115 search results - page 8 / 23 » Refolding planar polygons |
CGI
2003
IEEE
14 years 20 days ago
2003
IEEE
A hardware polygon rendering pipeline can be used together with hardware compositing to volume-render arbitrary unstructured grids composed of convex polyhedral cells. This techni...
DAM
2008
13 years 7 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
CCCG
2010
13 years 8 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
CCCG
2003
13 years 8 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...