ComputingComputer ScienceMathematicsComputational GeometryGeometric ModelingGeometryDelaunay TriangulationsEuclidean GeometryGeometry ProcessingDelaunay Triangulation AlgorithmsGeometric TriangulationTriangulation AlgorithmsTriangulation GraphsTriangulations
Article Free Access Share on The path of a triangulation Author: Oswin Aichholzer Institute for Theoretical Computer Science, Graz University of Technology, Klosterwiesgasse 32/1, A-8010 Graz, Austria Institute for Theoretical Computer Science, Graz University of Technology, Klosterwiesgasse 32/1, A-8010 Graz, AustriaView Profile Authors Info & Claims SCG '99: Proceedings of the fifteenth annual symposium on Computational geometryJune 1999 Pages 14–23https://doi.org/10.1145/304893.304896Published:13 June 1999Publication History 16citation539DownloadsMetricsTotal Citations16Total Downloads539Last 12 Months20Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
10
Algorithms in Combinatorial Geometry.
Jacob E. Goodman, Herbert Edelsbrunner · American Mathematical Monthly · 1989 · 1.8K citations
Reverse search for enumeration
David Avis, Komei Fukuda · Discrete Applied Mathematics · 1996 · 760 citations
Analytic combinatorics of non-crossing configurations
Philippe Flajolet, Marc Noy · Discrete Mathematics · 1999 · 170 citations · Full text
Computing a subgraph of the minimum weight triangulation
Julian Keil · Computational Geometry · 1994 · 63 citations
Encoding a triangulation as a permutation of its point set.
Markus Denny, Christian Sohler · 1997 · 55 citations