995 search results - page 121 / 199 » Constructive Volume Geometry |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
VIS
2004
IEEE
14 years 9 months ago
2004
IEEE
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
CASC
2007
Springer
14 years 2 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
NPAR
2006
ACM
14 years 1 months ago
2006
ACM
Creating 3D plant models is often a hard and laborious task. To make it easier and more natural, we propose a sketch-based interface for modeling single-compound plant structures ...