Sciweavers

3025 search results - page 129 / 605
» Computational geometry: a retrospective
Sort
View
COMPGEOM
2005
ACM
14 years 3 days ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
COMPGEOM
1999
ACM
14 years 2 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
CSJM
2008
88views more  CSJM 2008»
13 years 10 months ago
A zero-dimensional approach to compute real radicals
The notion of real radicals is a fundamental tool in Real Algebraic Geometry. It takes the role of the radical ideal in Complex Algebraic Geometry. In this article I shall describ...
Silke J. Spang
COMPGEOM
2000
ACM
14 years 2 months ago
Computing approximate shortest paths on convex polytopes
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
COMPGEOM
2000
ACM
14 years 2 months ago
Look - a Lazy Object-Oriented Kernel for geometric computation
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
Stefan Funke, Kurt Mehlhorn