COMPGEOM 2001 - PDF Preprint Papers

COMPGEOM 2001 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2001 Paper

click to vote

COMPGEOM
2001
ACM

187views Discrete Geometry» more COMPGEOM 2001»

The convex hull of ellipsoids

14 years 4 months ago

Download www.staff.uni-mainz.de

The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...

Nicola Geismann, Michael Hemmer, Elmar Schöme...

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	187	The convex hull of ellipsoids	claim
2	174	Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!	claim
3	137	Computational geometry for sculpture	claim
4	126	Balanced lines, halving triangles, and the generalized lower bound theorem	claim
5	125	PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation	claim
6	119	Walking in a triangulation	claim
7	119	Segment intersection searching problems in general settings	claim
8	116	Discrete mobile centers	claim
9	113	The Clarkson-Shor technique revisited and extended	claim
10	99	Box-trees and R-trees with near-optimal query time	claim
11	98	A fully dynamic algorithm for planar	claim
12	96	Hierarchical morse complexes for piecewise linear 2-manifolds	claim
13	93	Farthest neighbors and center points in the presence of rectangular obstacles	claim
14	93	A segment-tree based kinetic BSP	claim
15	93	Detecting undersampling in surface reconstruction	claim
16	92	A practical approach for computing the diameter of a point set	claim
17	89	Efficient and small representation of line arrangements with applications	claim
18	89	A randomized art-gallery algorithm for sensor placement	claim
19	88	On the distinct distances determined by a planar point set	claim
20	87	Sink-insertion for mesh improvement	claim
21	87	Efficient perspective-accurate silhouette computation and applications	claim
22	83	Simplifying a polygonal subdivision while keeping it simple	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers