CAD data visualization on mobile devices using sequential constrained Delaunay triangulation

Yang, Sang Wook; Choi, Young Ki; Lee, Hyun Chan

doi:10.1016/j.cad.2008.08.005

Cited by 12 publications

(8 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, Qiu et al proposed a method for geometric model simplification for distributed CAD in order to allow real time collaboration [66]. Yang proposed an approach to CAD data visualization on mobile devices using constrained Delaunay triangulation [67]. Kim and Albers addressed Web design issues when searching for information in a small screen display [68].…”

Section: Forms Of Manifestationmentioning

confidence: 99%

Ubiquitous computer aided design: A broken promise or a Sleeping Beauty?

Horváth

Vroom

2015

Computer-Aided Design

View full text Add to dashboard Cite

Section: Forms Of Manifestationmentioning

confidence: 99%

Ubiquitous computer aided design: A broken promise or a Sleeping Beauty?

Horváth

Vroom

2015

Computer-Aided Design

View full text Add to dashboard Cite

“…In a previous study, 14 Yang et al proposed the Constraint Embedded Triangles (CET) data structure for the sequential constrained triangulation of trimmed surfaces. The data structure used by the FBD&C is almost the same as the CET data structure, except for the constraint information.…”

Section: Indexed Triangle Data Structurementioning

confidence: 99%

A divide-and-conquer Delaunay triangulation algorithm with a vertex array and flip operations in two-dimensional space

Yang

Choi

Jung

2011

Int. J. Precis. Eng. Manuf.

Self Cite

View full text Add to dashboard Cite

Divide-and-conquer algorithms provide computational efficiency for constructing Delaunay triangulations; however, their implementation is complicated. Most divide-and-conquer algorithms for Delaunay triangulation utilize edge-based structures, because triangles are frequently deleted and created during the merge process. However, as our proposed divide-and-conquer algorithm does not require existing edges to be deleted in the merge process, a simple array-based data structure can be used for the representation of the triangulation topology. Rather than deleting the edges of the conflicting triangles, which was used in previous methods, the Delaunay property is also preserved with a new flip propagation method in the merge phase. This array-based data structure is much simpler than the commonly used edge-based data structures and requires less memory allocation. The proposed algorithm arranges sites into a permutation vector that represents a kdtree with an array; thus, the space partitioning information is internally represented in the array without any additional data. Since the proposed divide-and-conquer algorithm is compact, the implementation complexity of conventional divideand-conquer triangulation algorithms can be avoided. Despite of the simplicity of this new algorithm, the experimental results indicate that the computational efficiency is comparable to the previous divide-and-conquer algorithms.

show abstract

“…A constrained Delaunay triangulation (CDT) is constructed for each boundary curve, such that a curve is introduced to the base surface by inserting nodes on the curve using a CDT insertion kernel. To control the surface approximation error, dense sampling for the curve and the base surface was advocated by References 23,24.…”

Section: Introductionmentioning

confidence: 99%

PASM: Parallel aligned surface meshing

Cao

Shan

et al. 2021

Numerical Meth Engineering

View full text Add to dashboard Cite

Computer-aided design (CAD) models of industrial design are often plagued with a series of defects, including minute features, gaps, self-intersections, and misalignments. The development of schemes in automatic defeaturing, gaps repairing, and intersection removal usually requires a discrete representation of the geometry. However, existing surface meshing methods could not effectively handle sliver surfaces and assemblies with complex contact conditions, including multiple misaligned curves/surfaces and degenerated or free-form-shaped interface of contact. A surface meshing method based on a meshing-and-synchronizing strategy is proposed, which tackles the mesh generation of sliver surfaces and the cleanup of misaligned assemblies by means of mesh alignment. The mesh generation is performed in a hierarchical manner with curves and surfaces being meshed in sequence. By incorporating the synchronization strategy into the curve/surface meshing process, curve/surface mesh alignment is achieved automatically without compromising the mesh quality. Thanks to the alignment, the curve mesh generated by aligned curve meshing (ACM) is free of intersections, which enhances the meshing of sliver surfaces. By enforcing mesh alignment, aligned surface meshing (ASM) can handle misaligned assemblies with complex contact conditions. ASM is parallelized by using OpenMP. Various assemblies characterized with difficult misaligned features and touches are well processed by parallel ASM.

show abstract

CAD data visualization on mobile devices using sequential constrained Delaunay triangulation

Cited by 12 publications

References 15 publications

Ubiquitous computer aided design: A broken promise or a Sleeping Beauty?

Ubiquitous computer aided design: A broken promise or a Sleeping Beauty?

A divide-and-conquer Delaunay triangulation algorithm with a vertex array and flip operations in two-dimensional space

PASM: Parallel aligned surface meshing

Contact Info

Product

Resources

About