Embedding a triangular graph within a given boundary

DOI10.1016/j.cagd.2011.07.001zbMath1233.65023OpenAlexW2152267336MaRDI QIDQ654561

Renjie Chen, Craig Gotsman, Yin Xu, Li-Gang Liu

Publication date: 29 December 2011

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2011.07.001

zbMATH Keywords

algorithmtriangulationembeddingplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph algorithms (graph-theoretic aspects) (05C85) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (4)

Centroidal Voronoi tessellation based polycube construction for adaptive all-hexahedral mesh generation ⋮ A Novel Algorithm for Volume-Preserving Parameterizations of 3-Manifolds ⋮ On inversion-free mapping and distortion minimization ⋮ Surface segmentation for polycube construction based on generalized centroidal Voronoi tessellation

Cites Work

• Parametrization and smooth approximation of surface triangulations
• Tutte's barycenter method applied to isotopies
• Volumetric harmonic map
• Convex combination maps over triangulations, tilings, and tetrahedral meshes
• Convex Drawings of Graphs with Non-convex Boundary
• Computing Discrete Minimal Surfaces and Their Conjugates
• How to Draw a Graph

This page was built for publication: Embedding a triangular graph within a given boundary