COMPGEOM 2005 - PDF Preprint Papers

COMPGEOM 2005 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2005 Paper

click to vote

COMPGEOM
2005
ACM

310views Discrete Geometry» more COMPGEOM 2005»

The skip quadtree: a simple dynamic data structure for multidimensional data

12 years 7 months ago

Download www.ics.uci.edu

We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...

David Eppstein, Michael T. Goodrich, Jonathan Z. S...

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	310	The skip quadtree: a simple dynamic data structure for multidimensional data	claim
2	240	Animation of curve constrained drawings of planar graphs	claim
3	152	Cache-oblivious r-trees	claim
4	136	The Visibility-Voronoi Complex and Its Applications	claim
5	135	Abstract order type extension and new results on the rectilinear crossing number	claim
6	132	Dynamic maintenance of molecular surfaces under conformational changes	claim
7	129	Fast construction of nets in low dimensional metrics, and their applications	claim
8	129	Star splaying: an algorithm for repairing delaunay triangulations and convex hulls	claim
9	128	On the exact computation of the topology of real algebraic curves	claim
10	123	1-link shortest paths in weighted regions	claim
11	121	Provable dimension detection using principal component analysis	claim
12	121	Inequalities for the curvature of curves and surfaces	claim
13	118	Incidences of not-too-degenerate hyperplanes	claim
14	115	Stability of persistence diagrams	claim
15	111	Curvature-bounded traversals of narrow corridors	claim
16	107	Learning smooth objects by probing	claim
17	103	Inclusion-exclusion formulas from independent complexes	claim
18	102	Shortest path amidst disc obstacles is computable	claim
19	100	Multi-pass geometric algorithms	claim
20	97	Cache-oblivious planar orthogonal range searching and counting	claim
21	97	Hadwiger and Helly-type theorems for disjoint unit spheres in R3	claim
22	97	Finding the best shortcut in a geometric network	claim
23	94	Maximizing the overlap of two planar convex sets under rigid motions	claim
24	93	Exact Minkowski sums of convex polyhedra	claim
25	92	Guarding a terrain by two watchtowers	claim
26	86	Energy-aware stage illumination	claim
27	85	Smaller coresets for k-median and k-means clustering	claim
28	78	Kinetic sorting and kinetic convex hulls	claim
29	74	Minimum dilation stars	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers