CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the Number of Pseudo-Triangulations of Certain Point Sets Oswin Aichholzer∗ David Orden†

First Page		Document Content
Date: 2004-01-08 18:44:37 Topology Pseudotriangle Catalan number Convex hull Tessellation Planar straight-line graph Jump-and-Walk algorithm Geometry Mathematics Triangulation		CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the Number of Pseudo-Triangulations of Certain Point Sets Oswin Aichholzer∗ David Orden† Add to Reading List Source URL: www.cccg.ca Download Document from Source Website File Size: 132,57 KB Share Document on Facebook

	Cone Walk Navigating a random Delaunay triangulation Nicolas Broutin, Olivier Devillers, Ross Hemsley December 18, 2013 DocID: 1oNTj - View Document
	I/O-Efficient Construction of Constrained Delaunay Triangulations Pankaj K. Agarwal1? , Lars Arge2,1?? , and Ke Yi1? ? ? 1 Department of Computer Science, Duke University, Durham, NC 27708, USA. DocID: 1giST - View Document
	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Minimum Dilation Triangulation: Reaching Optimality Efficiently Al´ex F. Brandt∗ Miguel M. Gaiowski∗ DocID: 17ZWZ - View Document
	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the Number of Pseudo-Triangulations of Certain Point Sets Oswin Aichholzer∗ David Orden† DocID: 17L8c - View Document
	! ! “C7303” — — 9:49 DocID: 13iw3 - View Document