On compatible triangulations with a minimum number of Steiner points

DOI10.1016/j.tcs.2020.06.014zbMath1467.68199arXiv1706.09086OpenAlexW2962776977MaRDI QIDQ2192383

Debajyoti Mondal, Anna Lubiw

Publication date: 17 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.09086

zbMATH Keywords

NP-hardnesspolygonal regionslinear homeomorphismscompatible triangulations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On Compatible Matchings

Cites Work

• Unnamed Item
• Deformations of plane graphs
• Towards compatible triangulations.
• The complexity of drawing a graph in a polygonal region
• Applications of the crossing number
• On compatible triangulations of simple polygons
• Complexity of Some Geometric and Topological Problems
• Constructing pairwise disjoint paths with few links
• ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
• Algorithms and Computation
• How to Morph Planar Graph Drawings
• Drawing Partially Embedded and Simultaneously Planar Graphs
• Embedding planar graphs at fixed vertex locations

This page was built for publication: On compatible triangulations with a minimum number of Steiner points