Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On the number of facets of three-dimensional Dirichlet Stereohedra III: full cubic groups
Sabariego P., Santos F. Discrete & Computational Geometry40 (2):159-189,2008.Type:Article
Date Reviewed: Apr 16 2009

Suppose that S is a discrete point set in Rn. For any point pS, the Voronoi o region is the set of points in Rn closer to p than to any other point of S. If the set S is the orbit of a crystallographic group that stabilizes p trivially, then the Voronoi o region is called a Dirichlet region. The decomposition of Rn into Voronoi o regions is a Dirichlet tessellation and its tiles are Dirichlet stereohedra.

In two previous papers [1,2], Santos, the second author of this paper, and D. Bochiș search for the maximal number of facets Dirichlet stereohedra can have for three-dimensional crystallographic groups. In this paper, which can be considered the third paper in the series, the authors show that Dirichlet stereohedra for the 27 full three-dimensional crystallographic groups can have no more than 25 facets. The notion “full” refers to the recent classification of three-dimensional crystallographic groups. Apart from this upper bound on the number of facets, the authors construct stereohedra with 17 facets for one of these groups.

This paper is a nice contribution to the understanding of stereohedra related to crystallographic groups, which is still incomplete by comparison to the progress made in the classification of crystallographic groups in recent decades. The authors also announce a subsequent paper, in which they will deal with the number of facets of Dirichlet stereohedra for quarter cubic crystallographic groups.

Reviewer:  Jan De Beule Review #: CR136700 (0912-1179)
1) Bochiș, D.; Santos, F. On the number of facets of three-dimensional Dirichlet stereohedra I: groups with reflections. Discrete and Computational Geometry 25, 3(2001), 419–444.
2) Bochiș, D.; Santos, F. On the number of facets of three-dimensional Dirichlet stereohedra II: non-cubic groups. Beitrdge zur Algebra und Geometrie 47, 1(2006), 89–120.
Bookmark and Share
  Featured Reviewer  
 
Geometrical Problems And Computations (F.2.2 ... )
 
 
Counting Problems (G.2.1 ... )
 
 
Combinatorics (G.2.1 )
 
 
Computational Geometry And Object Modeling (I.3.5 )
 
Would you recommend this review?
yes
no
Other reviews under "Geometrical Problems And Computations": Date
Some performance tests of convex hull algorithms
Allison D., Noga M. BIT 24(1): 2-13, 1984. Type: Article
Feb 1 1985
A fast voronoi-diagram algorithm with quaternary tree bucketing
Ohya T., Iri M., Murota K. Information Processing Letters 18(4): 227-231, 1984. Type: Article
Jan 1 1985
Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
Chazelle B. (ed) SIAM Journal on Computing 13(3): 488-507, 1984. Type: Article
Mar 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy