4 search results - page 1 / 1 » Tiling Polygons with Lattice Triangles |
DCG
2010
13 years 11 months ago
2010
Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the x-axis, we look at the problem of the location of the vertices for a...
COMBINATORICS
1999
13 years 10 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
AE
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We report the use of MGS, a declarative and rule-based language, for the modeling of various self-assembly processes. The approach is illustrated on the fabrication of a ...
CGF
2008
13 years 11 months ago
2008
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...