Constrained delaunay triangulation using delaunay visibility

Authors:
Yi-Jun Yang;Hui Zhang;Jun-Hai Yong;Wei Zeng;Jean-Claude Paul;Jiaguang Sun
Affiliations:
School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China
Venue:
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Year:
2006

Citing 8
Cited 1

Finite element mesh generation methods: a review and classification

Computer-Aided Design
Real-time rendering of trimmed surfaces

SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

ACM Transactions on Graphics (TOG)
Three dimensional apparel CAD system

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software (TOMS)
Delaunay Triangulation Using a Uniform Grid

IEEE Computer Graphics and Applications
Construction Of the Constrained Delaunay Triangulation Of A Polygonal Domain

CAD Systems Development: Tools and Methods [Dagstuhl Seminar, 1995]
Techincal section: An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization

Computers and Graphics

Investigations on the polygonal finite element method: Constrained adaptive Delaunay tessellation and conformal interpolants

Computers and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional visibility with Delaunay visibility. With Delaunay visibility introduced, all strongly Delaunay edges are excluded from the computation of visibility. Furthermore, a sufficient condition for DT (CDT whose triangles are all Delaunay) existence is presented to decrease the times of visibility determinations. The mesh generator is robust and exhibits a linear time complexity for randomly generated PSLGs.