1233 search results - page 5 / 247 » Extensible Point Location Algorithm |
76
Voted
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— We present a new algorithm for scan registration of colored 3D point data which is an extension to the Normal Distributions Transform (NDT). The probabilistic approach of NDT i...
69
Voted
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
Using and extending a framework is a challenging task whose difficulty is exacerbated by the poor documentation that generally comes with the framework. Even in the presence of do...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...