COMPGEOM 1995 - PDF Preprint Papers

COMPGEOM 1995 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-1995 Paper

click to vote

COMPGEOM
1995
ACM

188views Discrete Geometry» more COMPGEOM 1995»

Approximate Range Searching

13 years 8 months ago

Download www.cs.umd.edu

The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...

Sunil Arya, David M. Mount

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	188	Approximate Range Searching	claim
2	174	A Comparison of Sequential Delaunay Triangulation Algorithms	claim
3	143	Minimal Enclosing Parallelogram with Application	claim
4	135	How Good are Convex Hull Algorithms?	claim
5	122	Searching for the Kernel of a Polygon - A Competitive Strategy	claim
6	117	Strategies for Polyhedral Surface Decomposition: An Experimental Study	claim
7	117	Representation and Computation of Boolean Combinations of Sculptured Models	claim
8	110	VideHoc: A Visualizer for Homogeneous Coordinates	claim
9	101	On Conway's Thrackle Conjecture	claim
10	98	Immobilizing Polygons against a Wall	claim
11	93	Triangulations Intersect Nicely	claim
12	87	A New Technique for Analyzing Substructures in Arrangements	claim
13	86	The Rectangle Enclosure and Point-Dominance Problems Revisited	claim
14	78	Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers