Sciweavers

676 search results - page 56 / 136
» A Search-Free Intersection Algorithm
Sort
View
COMPGEOM
2006
ACM
13 years 12 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
COMPGEOM
1995
ACM
14 years 1 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
14 years 1 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
CG
2005
Springer
13 years 9 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...
SASO
2007
IEEE
14 years 4 months ago
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
Ankit Patel, Julius Degesys, Radhika Nagpal