| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 440902 | Computer Aided Geometric Design | 2011 | 8 Pages |
Abstract
Given a 3-vertex-connected triangular planar graph and an embedding of its boundary vertices, can the interior vertices be embedded to form a valid triangulation? We describe an algorithm which decides this problem and produces such an embedding if it exists.
► We present an algorithm for embedding a triangular graph within a given boundary. ► The algorithm will decide whether such embedding exists, and produce one if it does. ► The algorithm is extended to improve the quality of the resulting triangulation.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Yin Xu, Renjie Chen, Craig Gotsman, Ligang Liu,