Sciweavers

2188 search results - page 12 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 8 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
CAD
2007
Springer
13 years 8 months ago
Interpolation by geometric algorithm
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Alt...
Takashi Maekawa, Yasunori Matsumoto, Ken Namiki
COMPGEOM
2009
ACM
14 years 3 months ago
Parallel geometric algorithms for multi-core computers
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
Vicente H. F. Batista, David L. Millman, Sylvain P...
CAD
2006
Springer
13 years 8 months ago
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang
ECCV
2002
Springer
14 years 10 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel