Article PDF
Avoid common mistakes on your manuscript.
References
Asano, T., Edahiro, M., Imai, H., Iri, M., and Murota, K., ‘Practical use of Bucketing Techniques in Computational Geometry’ (to appear in Computational Geometry, North-Holland).
Besag, J., ‘Spatial Interaction and the Statistical Analysis of Lattice Systems’, J. Royal Stat. Soc. Series B 36 (1974), 192–236.
Brostow, W., Dussault, J. P., and Fox, B. L., ‘Construction of Voronoi Polyhedra’, J. Comp. Phys. 30 (1978), 81–92.
Brown, K. Q., ’Voronoi Diagrams from Convex Hulls’, Inf. Proc. Lett. 7 (1979), 223–228.
Crapo, H., ‘Structural Rigidity’, Structural Topology (1979), 13–45.
Cremona, L., Graphical Statics (translation of Le figure reciproche nelle statica graphica, 1872), Oxford University Press, London, 1890.
Coxeter, H. S. M., Introduction to Geometry, Wiley, 1961.
Descartes, R., Les Principes de la Philosophie, Elzevier, Amsterdam, 1644.
Dirichlet, P. G. L., ‘Über die Reduction der positiven quadratische formen mit drei unbestimmten ganzen Zahlen’, J. riene angew. Math. 40 (1850), 209–227.
Drysdale, R. L., ‘Generalized Voronoi Diagrams and Geometric Searching’, Ph.D. thesis, Stanford University, Computer Science Department, January, 1979.
Gilbert, E. N., ‘Random Subdivisions of Space into Crystals’, Ann. Math. Stat. 33 (1962), 958–972.
Green, P. J. and Sibson, R., ‘Computing Dirichlet Tessellations in the Plane’, Comput. J. 21 (1978), 168–173.
Grunbaum, B., Convex Polytopes, Wiley/Interscience, New York, 1967.
Grunbaum, B. and Shephard, G. C., ‘Tilings with Congruent Tiles’, Bull. (New Series) Amer. Math. Soc. 3 (1980), 951–973.
Honda, H., ‘Description of Cellular Patterns by Dirichlet Domains: The Two-Dimensional Case’, J. Theor. Biol. 107 (1978), 523–543.
Horspool, R. N., ‘Constructing the Voronoi Diagram in the Plane, Technical Report SOCS 79.12, School of Computer Science, McGill University, 1979.
Iri, M., Murota, K., and Ohya, T., ‘A Fast Voronoi-Diagram Algorithm with Applications to Geographical Optimization’, Lecture Notes in Control and Information Sciences 59, Springer, 1984.
Klee, V., ‘On the Complexity of d-Dimensional Voronoi Diagrams’, Technical Report 64, Department of Mathematics, University of Washington, 1979.
Linhart, J., ‘Dirichletsche Zellenkomplexe mit maximaler Eckenzahl’, Geom. Dedicata 11 (1981), 363–367.
Loeb, A. L., Space Structures, their Harmony and Counterpoint, Addison Wesley, Reading, Mass., 1976.
Maxwell, J. C., ‘On Reciprocal Figures and Diagrams of Forces’, Phil. Mag. Series4 (1864), 250–261.
Maxwell, J. C., ‘On Reciprocal Figures, Frames, and Diagrams of Forces’, Trans. Royal Soc. Edinburgh 26 (1869–72), 1–40.
Miles, R. E., ‘The Random Division of Space’, Suppl. Adv. Appl. Prob. (1972), 243–266.
Mollison, D., ‘Spatial Contact Models for Ecological and Epidemic Spread’, J. Royal Stat. Soc., Series B 39 (1977), 283–326.
Nowacki, W., ‘Über allegemeine Eigenschaften von Wirkungsbereichen’, Z. Kristal. (1976), 360–368.
Ohya, T., Iri, M., and Murota, K., ‘A Fast Voronoi-Diagram Algorithm with Quaternary Tree Bucketing’, Inf. Proc. Lett. 18 (1984), 227–231.
Ohya, T., Iri, M., and Murota, K., ‘Improvements of the Incremental Method for the Voronoi Diagram with Computational Comparison of Various Algorithms’, J. Operations Res. Soc. Japan 27 (1984), 306–336.
Rogers, C. A., Packing and Covering, Cambridge Mathematical Tract 54, Cambridge University Press, 1964.
Schoenberg, I. J., Mathematical Time Exposures, Mathematical Association of America, 1982.
Sibson, R., ‘A Vector Identity for the Dirichlet Tessellationrs, Math. Proc. Camb. Phil. Soc. 87 (1980), 151–155.
Smith, C. S., ‘Grain Shapes and Other Metallurgical Applications of Topology’, Metal Interfaces, American Society for Metals, Cleveland, Ohio (1952), pp. 65–113.
Toussaint, G. T., ‘The Relative Neighbourhood Graph of a Finite Planar Set’, Pattern Recognition 13 (1980), 261–268.
Toussaint, G. T. and Menard, R., ‘Fast Algorithms for Computing the Planar Relative Neighbourhood Graph, Methods of Operations Research, Proc. Fifth Symp. on Operations Research, University of Koln, 1980, pp. 425–428.
Toussaint, G. T. and Battacharya, B. K., ‘On Geometric Algorithms that use the Furthest Point Voronoi Diagram’, Technical Report No. SOCS-81.3, School of Computer Science, McGill University, Montreal, Canada, 1981.
Toussaint, G. T., Battacharya, B. K., and Poulsen, R. S., ‘The Application of Voronoi Diagrams to Nonparametric Decision Rules’, Proc. Computer Science and Statistics: 16th Symp. on the Interface, Atlanta, Georgia, 1984.
Voronoi, G., ‘Nouvelles applications des parametres continus a la theorie des formes quadratiques. Deux. Mem. Recherches sur les paralleloedres primitifs, Sec. partie, J. reine angew, Math. 136 (1909), 67–181.
Whiteley, W., ‘Realizability of polyhedra’, Structural Topology (1979), 46–58.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ash, P.F., Bolker, E.D. Recognizing Dirichlet tessellations. Geom Dedicata 19, 175–206 (1985). https://doi.org/10.1007/BF00181470
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00181470