| |
1-10 of 11 reviews |
Date Reviewed | |
| |
A generalisation of Tverberg’s theorem
Soberón P., Strausz R. Discrete & Computational Geometry 47(3): 455-460, 2012. Type: Article
Tverberg’s theorem is a result from discrete geometry, which states that, in any d-dimensional vector space for any set of (k-1)(d+1)+1 points in that vector space, the...
|
Dec 3 2012 |
|
| |
Curvature, geometry and spectral properties of planar graphs
Keller M. Discrete & Computational Geometry 46(3): 500-525, 2011. Type: Article
Keller characterizes theorems of planar graphs, using curvature functions. A curvature function is defined as a function on corners, on vertices, or on faces of the graph. The main part of the paper deals with different characterizatio...
|
Jun 28 2012 |
|
| |
Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
Miller E., Pak I. Discrete & Computational Geometry 39(1): 339-388, 2008. Type: Article
This is a long, complex, and incredibly rich paper. It contains, in some sense, one main result: the source unfolding that unfolds the surface of a convex polyhedron P to a planar, nonoverlapping polygon
|
Apr 8 2010 |
|
| |
On the number of facets of three-dimensional Dirichlet Stereohedra III: full cubic groups
Sabariego P., Santos F. Discrete & Computational Geometry 40(2): 159-189, 2008. Type: Article
Suppose that S is a discrete point set in Rn. For any point p ∈ S, the Voronoi o region is the set of...
|
Apr 16 2009 |
|
| |
Shortest watchman routes in simple polygons
Chin W., Ntafos S. Discrete & Computational Geometry 5(5): 9-31, 1990. Type: Article
The authors call a path in a polygon a watchman route if it is a closed cycle such that every point in the polygon is visible (by interior line of sight) from some point of the route. Thus a watchman could follow this route to p...
|
Mar 1 1991 |
|
| |
Efficient binary space partitions for hidden-surface removal and solid modeling
Paterson M. (ed), Yao F. Discrete & Computational Geometry 5(5): 485-503, 1990. Type: Article
A binary space partition (BSP) is a useful hierarchical partition of a set of objects in space. It may be defined in two stages: first without the objects, and second including the objects....
|
Mar 1 1991 |
|
| |
Toughness and Delaunay triangulations
Dillencourt M. Discrete & Computational Geometry 5(6): 575-601, 1990. Type: Article
Because Delaunay triangulations (Voronoi diagram duals) capture nearness between vertices, their edges are natural candidates for connecting dots to form single perceptual figures, a task common in computer vision. A figure that is a s...
|
Mar 1 1991 |
|
| |
Discrete & Computational Geometry (v.5 n.2)
Goodman J. (ed) Pollack R. (ed) Discrete & Computational Geometry 22:1990. Type: Journal
Hopcroft’s Problem...
|
Dec 1 1990 |
|
| |
Discrete & Computational Geometry (v.5 n.2)
Goodman J. (ed) Pollack R. (ed) Discrete & Computational Geometry 22:1990. Type: Journal
Hopcroft’s Problem...
|
Dec 1 1990 |
|
| |
Discrete & Computational Geometry (v.5 n.2)
Goodman J. (ed) Pollack R. (ed) Discrete & Computational Geometry 22:1990. Type: Journal
Hopcroft’s Problem...
|
Dec 1 1990 |
|
| |
|
|
| |
|
|
|
|
