Sciweavers

335 search results - page 7 / 67
» Volume Queries in Polyhedra
Sort
View
FOCS
1991
IEEE
13 years 11 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
14 years 4 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron
COMPGEOM
1994
ACM
13 years 11 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
14 years 1 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...
VLDB
1992
ACM
108views Database» more  VLDB 1992»
13 years 11 months ago
Querying in Highly Mobile Distributed Environments
New challenges to the database field brought about by the rapidly growing area of wireless personal communication are presented. Preliminary solutions to two of the major problems...
Tomasz Imielinski, B. R. Badrinath