CCCG 2009 - PDF Preprint Papers

CCCG 2009

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCCG-2009 Paper

click to vote

CCCG
2009

172views Computational Geometry» more CCCG 2009»

On the Dilation of Delaunay Triangulations of Points in Convex Position

13 years 5 months ago

Download cccg.ca

Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...

Shiliang Cui, Iyad A. Kanj, Ge Xia

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	172	On the Dilation of Delaunay Triangulations of Points in Convex Position	claim
2	172	New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model	claim
3	148	Computational Geometry of Contour Extraction	claim
4	136	A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods	claim
5	132	Colored Simultaneous Geometric Embeddings and Universal Pointsets	claim
6	131	Data Structures for Range Aggregation by Categories	claim
7	128	On Graph Thickness, Geometric Thickness, and Separator Theorems	claim
8	128	Bold Graph Drawings	claim
9	126	Enumeration of Polyominoes for p4 Tiling	claim
10	125	The Centervertex Theorem for Wedge Depth	claim
11	125	Clarkson's Algorithm for Violator Spaces	claim
12	121	Symmetry Restoration by Stretching	claim
13	120	Approximating Maximum Flow in Polygonal Domains using Spanners	claim
14	119	The Bichromatic Rectangle Problem in High Dimensions	claim
15	119	On the Height of a Homotopy	claim
16	119	Streaming 1-Center with Outliers in High Dimensions	claim
17	115	Data Structures for Reporting Extension Violations in a Query Range	claim
18	114	On Directed Graphs with an Upward Straight-line	claim
19	113	Every Large Point Set contains Many Collinear Points or an Empty Pentagon	claim
20	113	Wireless Localization with Vertex Guards is NP-hard	claim
21	112	Optimal Empty Pseudo-Triangles in a Point Set	claim
22	111	Nucleation-free 3D rigidity	claim
23	109	Defining and computing accessibility radius	claim
24	100	Relaxed Gabriel Graphs	claim
25	96	Rigid Components of Random Graphs	claim
26	95	Slope Preserving Terrain Simplification - An Experimental Study	claim
27	92	Open Problems from CCCG 2008	claim
28	88	Inapproximability of the Perimeter Defense Problem	claim
29	88	On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon	claim
30	85	Planar Packing of Diameter-Four Trees	claim
31	84	An Inequality on the Edge Lengths of Triangular Meshes	claim
32	83	Generalized jewels and the point placement problem	claim
33	82	How to make a picturesque maze	claim
34	72	Minimizing Slope Change in Imprecise 1.5D terrains	claim
35	70	General minisum circle location	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers