138 search results - page 2 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
SODA
2008
ACM
13 years 6 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...
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
CAGD
2008
13 years 4 months ago
2008
In this paper we present a local fitting algorithm for converting smooth planar curves to Bsplines. For a smooth planar curve a set of points together with their tangent vectors a...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...