21 search results - page 2 / 5 » Separating point sets in polygonal environments |
ICCS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. The complexity of virtual environments has grown spectacularly over the recent years, mainly thanks to the use of the currently cheap high performance graphics cards. As ...
JGTOOLS
2008
13 years 5 months ago
2008
We study the behavior of simple, 2-D, self-organizing primitives that interact and move in an unbounded environment to create aggregated shapes. Each primitive is represented by a ...
ALGOSENSORS
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
SODA
2001
ACM
13 years 7 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
VMV
2001
13 years 7 months ago
2001
This paper presents a new method for extracting cylinders from an unorganized set of 3D points. The originality of this approach is to separate the extraction problem into two dis...