9 search results - page 1 / 2 » An optimal algorithm for reporting visible rectangles |
IPL
2002
13 years 4 months ago
2002
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
CAINE
2003
13 years 6 months ago
2003
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
ECML
2004
Springer
13 years 10 months ago
2004
Springer
This report contains derivations which did not fit into the paper [3]. Associative clustering (AC) is a method for separately clustering two data sets when one-to-one association...