COMPGEOM 2006 - PDF Preprint Papers

COMPGEOM 2006 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2006 Paper

click to vote

COMPGEOM
2006
ACM

194views Discrete Geometry» more COMPGEOM 2006»

Minimum weight triangulation is NP-hard

14 years 6 months ago

Download www.cs.princeton.edu

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...

Wolfgang Mulzer, Günter Rote

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	194	Minimum weight triangulation is NP-hard	claim
2	177	Algorithms for two-box covering	claim
3	163	Plane embeddings of planar graph metrics	claim
4	163	Engineering a compact parallel delaunay algorithm in 3D	claim
5	162	Envelope surfaces	claim
6	149	I/O-efficient batched union-find and its applications to terrain analysis	claim
7	147	An optimal-time algorithm for shortest paths on a convex polytope in three dimensions	claim
8	146	Locked and unlocked chains of planar shapes	claim
9	141	Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope	claim
10	139	Colored intersection searching via sparse rectangular matrix multiplication	claim
11	131	Lower bounds on locality sensitive hashing	claim
12	126	Provably good sampling and meshing of Lipschitz surfaces	claim
13	124	Conflict-free colorings of shallow discs	claim
14	123	The effect of corners on the complexity of approximate range searching	claim
15	121	Refolding planar polygons	claim
16	120	Medial axis approximation and unstable flow complex	claim
17	118	A sampling theory for compact sets in Euclidean space	claim
18	118	Degenerate crossing numbers	claim
19	114	Online geometric reconstruction	claim
20	112	Optimal succinct representations of planar maps	claim
21	112	Minimum-cost coverage of point sets by disks	claim
22	108	Random triangulations of planar point sets	claim
23	107	On the maximum number of edges in topological graphs with no four pairwise crossing edges	claim
24	105	Minimum-cost load-balancing partitions	claim
25	103	The predicates for the Voronoi diagram of ellipses	claim
26	102	On approximating the smallest enclosing Bregman Balls	claim
27	101	How slow is the k-means method?	claim
28	101	Sliver removal by lattice refinement	claim
29	99	Iterated snap rounding with bounded drift	claim
30	98	On overlays and minimization diagrams	claim
31	96	Embedding ultrametrics into low-dimensional spaces	claim
32	89	Vines and vineyards by updating persistence in linear time	claim
33	87	A fast k-means implementation using coresets	claim
34	87	On the ICP algorithm	claim
35	81	An upper bound on the average size of silhouettes	claim
36	78	Complete subdivision algorithms, I: intersection of Bezier curves	claim
37	78	How to get close to the median shape	claim
38	78	Tight bounds for connecting sites across barriers	claim
39	77	Hole detection or: "how much geometry hides in connectivity?"	claim
40	77	Illustrating the streaming construction of 2D delaunay triangulations	claim
41	67	Splitting (complicated) surfaces is hard	claim
42	66	On realistic terrains	claim
43	58	Topology guaranteeing manifold reconstruction using distance function to noisy data	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers