CCCG 2009, Vancouver, BC, August 17–19, 2009 Relaxed Gabriel Graphs Prosenjit Bose∗ Jean Cardinal†

First Page		Document Content
Date: 2009-09-02 14:34:07 Triangulation Euclidean plane geometry Computational geometry Beta skeleton Delaunay triangulation Geometric graph theory Gabriel graph Graph Matching Graph theory Mathematics Geometry		CCCG 2009, Vancouver, BC, August 17–19, 2009 Relaxed Gabriel Graphs Prosenjit Bose∗ Jean Cardinal† Add to Reading List Source URL: cccg.ca Download Document from Source Website File Size: 186,61 KB Share Document on Facebook

	Triangulation Numbers Caspar and Klug found that only some arrangements of subunits can form quasisymmetrical capsids. To explain this, they developed the concept DocID: 1vdSu - View Document
	CONSTRUCTING REGULAR TRIANGULATION VIA LOCAL TRANSFORMATIONS: THEORETICAL AND PRACTICAL ADVANCES MINGCEN GAO DocID: 1tLli - View Document
	AN O(n2 log n) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION HERBERT EDELSBRUNNERy , TIOW SENG TANy AND ROMAN WAUPOTITSCHy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the m DocID: 1tKLY - View Document
	Edge Insertion for Optimal Triangulations1 M. Bern2 , H. Edelsbrunner3 , D. Eppstein4 , S. Mitchell5 and T. S. Tan3 Abstract The edge-insertion paradigm improves a triangulation of a nite point set in <2 iteratively by DocID: 1tKcZ - View Document
	A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION HERBERT EDELSBRUNNER AND TIOW SENG TANy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can b DocID: 1tH3b - View Document