Sciweavers

189 search results - page 13 / 38
» Graph-Theoretic Solutions to Computational Geometry Problems
Sort
View
CAD
2011
Springer
13 years 2 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
DICTA
2003
13 years 8 months ago
Computing Image-Based Reprojection Error on Graphics Hardware
This paper describes a novel approach to the problem of recovering information from an image set by comparing the radiance of hypothesised point correspondences. This method is app...
John W. Bastian, Anton van den Hengel
SIAMSC
2010
192views more  SIAMSC 2010»
13 years 5 months ago
Adaptive Discontinuous Galerkin Methods for Eigenvalue Problems Arising in Incompressible Fluid Flows
In this article we consider the a posteriori error estimation and adaptive mesh refinement of discontinuous Galerkin finite element approximations of the hydrodynamic stability p...
K. Andrew Cliffe, Edward J. C. Hall, Paul Houston
COCOA
2007
Springer
14 years 1 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
ICRA
1994
IEEE
127views Robotics» more  ICRA 1994»
13 years 11 months ago
"RISC" for Industrial Robotics: Recent Results and Open Problems
At the intersection of robotics, computational geometry, and manufacturingengineering, we have identifieda collection of research problems with near-term industrial applications. ...
John F. Canny, Kenneth Y. Goldberg