OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES∗ David Bremner† Erik Demaine‡ Pat Morin∗∗

First Page		Document Content
Date: 2007-12-27 15:24:28 Computational geometry Combinatorics Delaunay triangulation Convex hull algorithms Quicksort Convex hull Boundary Euclidean minimum spanning tree Pitteway triangulation Triangulation Geometry Mathematics		OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES∗ David Bremner† Erik Demaine‡ Pat Morin∗∗ Add to Reading List Source URL: john2.poly.edu Download Document from Source Website File Size: 223,67 KB Share Document on Facebook

	A GPU accelerated algorithm for 3D Delaunay triangulation DocID: 1tD02 - View Document
	Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation among all Delaunay DocID: 1tgo1 - View Document
	Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, and Alexander Wolff (a) a point set with four clusters at two different aspect ratios DocID: 1syGz - View Document
	Kinetic Data Structures: Animating Proofs Through Time Julien Basch∗ Jo˜ao Comba† Leonidas J. Guibas‡ John Hershberger§ Craig D. Silverstein¶ Li Zhangk When motion begins, each certificate remains valid until th DocID: 1rmpv - View Document
	Information Processing Letters–42 www.elsevier.com/locate/ipl HCPO: an efficient insertion order for incremental Delaunay triangulation Sheng Zhou ∗ , Christopher B. Jones DocID: 1rggE - View Document