Sciweavers

1274 search results - page 117 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
CVPR
2012
IEEE
13 years 20 days ago
2.5D building modeling by discovering global regularities
We introduce global regularities in the 2.5D building modeling problem, to reflect the orientation and placement similarities between planar elements in building structures. Give...
Qian-Yi Zhou, Ulrich Neumann
108
Voted
RT
1998
Springer
15 years 2 months ago
Interactively Modeling with Photogrammetry
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
Pierre Poulin, Mathieu Ouimet, Marie-Claude Frasso...
78
Voted
COMPGEOM
1994
ACM
15 years 2 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...
95
Voted
COMPGEOM
2005
ACM
15 years 5 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...
79
Voted
COMPGEOM
2008
ACM
15 years 20 hour ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...