1387 search results - page 21 / 278 » Convexity in Discrete Space |
SGP
2007
13 years 10 months ago
2007
Developable surfaces are surfaces that can be unfolded into the plane with no distortion. Although ubiquitous in our everyday surroundings, modeling them using existing tools requ...
DCG
2007
13 years 7 months ago
2007
Let C be a cone in R3 whose base B is a planar convex body in a horizontal plane π and whose tip is a point v /∈ π. Let C be a packing formed by translates of C and −C in R3...
TCS
2008
13 years 7 months ago
2008
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
DGCI
2006
Springer
13 years 9 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
JCDCG
1998
Springer
13 years 11 months ago
1998
Springer
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same...