Polygon placement under translation and rotation
Francis Avnaim, Jean-Daniel Boissonnat (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A Non-Recursive Algorithm for Polygon Triangulation”
Polygon placement under translation and rotation
Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
Polar coordinate drawing of planar graphs with good angular resolution.
Duncan, Christian A., Kobourov, Stephen G. (2003)
Journal of Graph Algorithms and Applications
Similarity:
Simple and efficient bilayer cross counting.
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Spanning trees with low crossing number
Jiří Matoušek (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A linear time algorithm for the computation of some distance functions between convex polygons
M. J. Atallah, C. C. Ribeiro, S. Lifschitz (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
A framework for the static and interactive visualization of statecharts.
Castelló, Rodolfo (2002)
Journal of Graph Algorithms and Applications
Similarity:
On polygons and polyhedra
Siniša Vrećica (2005)
The Teaching of Mathematics
Similarity:
Enumeration of integral tetrahedra.
Kurz, Sascha (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons
Mirzoev, Tigran, Vassilev, Tzvetalin (2010)
Serdica Journal of Computing
Similarity:
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2...