169
click to vote
JCDCG
15 years 11 months ago
2004 Springer 
An algorithm was presented in [1] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was conjectured that orthostacks could be ...
145
click to vote
JCDCG
15 years 11 months ago
2004 Springer 
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...
137
click to vote
JCDCG
15 years 11 months ago
2004 Springer 
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
|
Discrete Geometry