Embedding a triangular graph within a given boundary
DOI10.1016/J.CAGD.2011.07.001zbMATH Open1233.65023OpenAlexW2152267336MaRDI QIDQ654561FDOQ654561
Authors: Yin Xu, Renjie Chen, Craig Gotsman, Ligang 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Parametrization and smooth approximation of surface triangulations
- Computing Discrete Minimal Surfaces and Their Conjugates
- How to Draw a Graph
- Volumetric harmonic map
- Tutte's barycenter method applied to isotopies
- Convex combination maps over triangulations, tilings, and tetrahedral meshes
- Convex Drawings of Graphs with Non-convex Boundary
Cited In (5)
- Surface segmentation for polycube construction based on generalized centroidal Voronoi tessellation
- Restricted triangulation on circulant graphs
- 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
This page was built for publication: Embedding a triangular graph within a given boundary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654561)
