Sciweavers

102291 search results - page 64 / 20459
» Computability in Computational Geometry
Sort
View
IPL
2008
70views more  IPL 2008»
15 years 4 months ago
Minimum-perimeter enclosures
We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization
Joseph S. B. Mitchell, Valentin Polishchuk
COMPGEOM
2005
ACM
15 years 6 months 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...
142
Voted
DGCI
2006
Springer
15 years 7 months ago
Duality and Geometry Straightness, Characterization and Envelope
Duality applied to geometrical problems is widely used in many applications in computer vision or computational geometry. A classical example is the Hough Transform to detect linea...
Jean-Marc Chassery, David Coeurjolly, Isabelle Siv...
ICCV
2003
IEEE
16 years 6 months ago
Recovery of Epipolar Geometry as a Manifold Fitting Problem
Liran Goshen, Ilan Shimshoni, P. Anandan, Daniel K...
93
Voted
ICPR
2002
IEEE
16 years 5 months ago
Reconstructing Mirror Symmetric Scenes From a Single View Using 2-View Stereo Geometry
Alexandre R. J. François, Gérard G. ...