COMPGEOM
2000
ACM
14 years 4 months ago
2000
ACM
COMPGEOM
2000
ACM
14 years 4 months ago
2000
ACM
COMPGEOM
2000
ACM
14 years 4 months ago
2000
ACM
The regression depth of a hyperplane with respect to a set of n points in Rd is the minimum number of points the hyperplane must pass through in a rotation to vertical. We general...
COMPGEOM
2000
ACM
14 years 4 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
JCDCG
2004
Springer
14 years 5 months ago
2004
Springer
JCDCG
2004
Springer
14 years 5 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 ...
JCDCG
2004
Springer
14 years 5 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 ...
JCDCG
2004
Springer
14 years 5 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...
JCDCG
2004
Springer
14 years 5 months ago
2004
Springer
JCDCG
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Musical rhythm is considered from the point of view of geometry. The interaction between the two fields yields new insights into rhythm and music theory, as well as new ...