Sciweavers

727 search results - page 44 / 146
» One line and n points
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 1 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CAD
2008
Springer
14 years 10 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
ECCV
2000
Springer
15 years 11 months ago
A Six Point Solution for Structure and Motion
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
Frederik Schaffalitzky, Andrew Zisserman, Richard ...
CVPR
2000
IEEE
15 years 12 months ago
A Formal Classification of 3D Medial Axis Points and Their Local Geometry
This paper proposes a novel hypergraph skeletal representation for 3D shape based on a formal derivation of the generic structure of its medial axis. By classifying each skeletal ...
Peter J. Giblin, Benjamin B. Kimia
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
15 years 2 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...