676 search results - page 34 / 136 » A Search-Free Intersection Algorithm |
137
click to vote
CCCG
2008
15 years 3 months ago
2008
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
100
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
135
Voted
ESA
2009
Springer
15 years 6 months ago
2009
Springer
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
100
click to vote
3DIM
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper addresses a registration refinement problem and presents an accurate and fast Point-to-(Tangent) Plane technique. Point-to-Plane approach is known to be very accurate ...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...