Sciweavers

5210 search results - page 28 / 1042
» Exact geometric computation
Sort
View
COMPUTING
2004
79views more  COMPUTING 2004»
13 years 9 months ago
Planar Development of Free-Form Surfaces: Quality Evaluation and Visual Inspection
Surface flattening is a crucial problem for many applications as indicated by the steady flow of new methods appearing in related publications. Quality control of these methods, b...
Phillip N. Azariadis, Nickolas S. Sapidis
CVPR
2000
IEEE
14 years 12 months ago
Reconstruction from Six-Point Sequences
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
Richard I. Hartley, Nicolas Y. Dano
COMPGEOM
2006
ACM
14 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
COMPGEOM
2008
ACM
13 years 11 months ago
Visualizing and exploring planar algebraic arrangements: a web application
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
Pavel Emeliyanenko, Michael Kerber
CIE
2006
Springer
14 years 1 months ago
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
le conservative rational abstract geometrical computation is Turing-universal d abstract) J
Jérôme Durand-Lose