Sciweavers

4745 search results - page 189 / 949
» Discretization: An Enabling Technique
Sort
View
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
15 years 11 months ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
SMA
1999
ACM
152views Solid Modeling» more  SMA 1999»
15 years 10 months ago
Fast volume-preserving free form deformation using multi-level optimization
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
Gentaro Hirota, Renee Maheshwari, Ming C. Lin
COMPGEOM
1998
ACM
15 years 10 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic
COMPGEOM
1997
ACM
15 years 10 months ago
Empirical Testing of Algorithms for Variable-Sized Label Placement
We report an empirical comparision of different heuristic techniques for variable-sized pointfeature label placement. This work may not be copied or reproduced in whole or in part...
Jon Christensen, Stacy Friedman, Joe Marks, Stuart...
COMPGEOM
1996
ACM
15 years 10 months ago
New Lower Bounds for Convex Hull Problems in Odd Dimensions
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
Jeff Erickson