|
|
|
|
|
Nattawut Phetmak and Jittat Fakcharoenphol
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. This ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Franz Aurenhammer, Christoph Ladurner and Michael Steinkogler
We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is prop...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elzbieta Lewandowicz and Pawel Flisek
This article presents the Base Point Split (BPSplit) algorithm to generate a complex polygon skeleton based on sets of vector data describing lakes and rivers. A key feature of the BPSplit algorithm is that it is dependent on base points representing the...
ver más
|
|
|
|
|
|