Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
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...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, F...
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...