Checking geometric programs or verification of geometric structures

Computational Geometry: Theory and Applications

Volumn 12, Issue 1-2, 1999, Pages 85-103

  Mehlhorn, Kurt ^a   Näher, Stefan ^b   Seel, Michael ^a   Seidel, Raimund ^c   Schilz, Thomas ^a   Schirra, Stefan ^a   Uhrig, Christian ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^c SAARLAND UNIVERSITY   (Germany)

^d Algorithmic Solutions Software GmbH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012821270     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(98)00036-4     Document Type: Article

References (19)

1. C. Aragon, R. Seidel, Randomized search trees, in: Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, 1989, pp. 540-545.
2. M. Blum, S. Kannan, Programs that check their work, in: Proc. of the 21th Annual ACM Symp. on Theory of Computing, 1989.
3. M. Blum, M. Luby, R. Rubinfeld, Self-testing/correcting with applications to numerical problems, in: Proc. 22nd Annual ACM Symp. on Theory of Computing, 1990, pp. 73-83.
4. Ch. Burnikel, K. Mehlhorn, S. Schirra, On degeneracy in geometric computations, in: Proc. SODA '94, 1994, pp. 16-23.
5. K.L. Clarkson, K. Mehlhorn, R. Seidel, Four results on randomized incremental constructions, Computational Geometry 3 (1993) 185-212.
6. K.L. Clarkson, P.W. Shor, Applications of random sampling in computational geometry, II, J. Discrete Comput. Geom. (1989) 387-421.
7. B. Delaunay, Izv. Akad. Nauk SSSR 7 (1934) 793-800.
8. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer, Berlin, 1984.
9. K. Mehlhorn, Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer, Berlin, 1984.
10. K. Mehlhorn, M. Müller, S. Näher, J. Ziegler, An implementation of a convex hull algorithm, 1997. http://www.mpi-sb.mpg.de/∼mehlhorn/Programs.html.
11. K. Mehlhorn, S. Näher, LEDA: A platform for combinatorial and geometric computing, Comm. ACM 38 (1) (1995) 96-102.
12. K. Mehlhorn, S. Näher, Checking geometric structures, http : //www.mpi-sb.mpg. de/∼mehlhorn/ Programs.html.
13. K. Mehlhorn, S. Näher, Algorithm design and software libraries: Recent developments in the LEDA project, in: Algorithms, Software, Architectures, Information Processing '92, Vol. 1, Elsevier, North-Holland, Amsterdam, 1992, pp. 493-505.
14. K. Mehlhorn, S. Näher, Ch. Uhrig, The LEDA user manual (version R 3.4). Technical Report, Max-Planck-Institut für Informatik, 1996. http : //www.mpi-sb.mpg.de/LEDA/leda.html.
15. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
16. R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, in: Proc. 18th Annu. ACM Sympos. Theory Comput., 1986, pp. 404-413.
17. G. Voronoi, Nouvelles application des parametres continus à la théorie the formed quadratic, premiere memoire: Sur quelqes proprietes des formes quadratique positives parfaites, J. Reine Angew. Math. 134 (1908) 198-287.
18. G. Voronoi, Nouvelles application des parametres continus à la theorie the formed quadratic, deuxième memoire: Recherches sur les parallélloèdres primitifs, J. Reine Angew. Math. 136 (1909) 67-181.
19. A.T. White, Graphs, Groups, and Surfaces, North-Holland, Amsterdam, 1973.