Embedding a triangular graph within a given boundary

Authors:
Yin Xu;Renjie Chen;Craig Gotsman;Ligang Liu
Affiliations:
Dept. of Mathematics, Zhejiang University, Hangzhou 310027, China;Computer Science Faculty, Technion - Israel Institute of Technology, Haifa 32000, Israel;Computer Science Faculty, Technion - Israel Institute of Technology, Haifa 32000, Israel;Dept. of Mathematics, Zhejiang University, Hangzhou 310027, China
Venue:
Computer Aided Geometric Design
Year:
2011

Citing 6
Cited 2

Parametrization and smooth approximation of surface triangulations

Computer Aided Geometric Design
Controllable morphing of compatible planar triangulations

ACM Transactions on Graphics (TOG)
Tutte's barycenter method applied to isotopies

Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
High quality compatible triangulations

Engineering with Computers
Mean value coordinates for arbitrary planar polygons

ACM Transactions on Graphics (TOG)
Convex drawings of graphs with non-convex boundary

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

PolyCut: monotone graph-cuts for PolyCube base-complex construction

ACM Transactions on Graphics (TOG)
Consistent volumetric discretizations inside self-intersecting surfaces

SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing

Quantified Score

Hi-index	0.00

Visualization

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.