Nonregular Triangulations, View Graphs of Triangulations, and Linear Programming Duality

Authors:
Fumihiko Takeuchi
Affiliations:
-
Venue:
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Year:
2000

Citing 1
Cited 1

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry

Constructing convex 3-polytopes from two triangulations of a polygon

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a triangulation and a point, we define a directed graph representing the order of the maximal dimensional simplices in the triangulation viewed from the point. We prove that triangulations having a cycle the reverse of which is not a cycle in this graph viewed from some point are forming a (proper) subclass of nonregular triangulations. We use linear programming duality to investigate further properties of nonregular triangulations in connection with this graph.