1012 search results - page 8 / 203 » Segment intersection searching problems in general settings |
DGCI
2009
Springer
13 years 10 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
TASE
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...