Computing the width of a three-dimensional point set: An experimental study

ACM Journal of Experimental Algorithmics

Volumn 4, Issue , 1999, Pages 8-

  Schwerdt, Jörg ^a   Smid, Michiel ^a   Majhi, Jayanth ^b   Janardan, Ravi ^c  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b MENTOR GRAPHICS CORPORATION   (United States)

^c University of Minnesota   (United States)

Author keywords

Computational Geometry; Implementation; Layered Manufacturing; spherical geometry

Indexed keywords

EID: 84871100865     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/347792.347816     Document Type: Article

References (19)

1. Agarwal, P. K. and Sharir, M. 1996. Efficient randomized algorithms for some geometric optimization problems. Discrete Comput. Geom. 16, 317-337.
2. Bartuschka, U., Mehlhorn, K., and Näher, S. 1997. A robust and efficient implementation of a sweep line algorithm for the straight line segment intersection problem. In Proc. Workshop on Algorithm Engineering (Venice, Italy, 1997), pp. 124-135.
3. Bentley, J. L. and Ottmann, T. A. 1979. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28, 643-647.
4. Chazelle, B., Edelsbrunner, H., Guibas, L. J., and Shaeie, M. 1993. Diameter, width, closest line pair and parametric searching. Discrete Comput. Geom. 10, 183-196.
5. Graham, R. L., Knuth, D. E., and Patashnik, O. 1989. Concrete Mathematics. Addison-Wesley, Reading, MA.
6. Houle, M. E. and Toussaint, G. T. 1988. Computing the width of a set. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-10, 761-765.
7. Jacobs, P. F. 1992. Rapid Prototyping & Manufacturing: Fundamentals of StereoLithog-raphy. McGraw-Hill, New York.
8. Majhi, J., Janaedan, R., Schweedt, J., Smid, M., and Gupta, P. 1999a. Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. Theory Appl. 12, 241-267.
9. Majhi, J., Janardan, R., Smid, M., and Gupta, P. 1999b. On some geometric optimization problems in layered manufacturing. Comput. Geom. Theory Appl. 12, 219-239.
10. Majhi, J., Janardan, R., Smid, M., and Schwerdt, J. 1998. Multi-criteria geometric optimization problems in layered manufacturing. In Proc. 14th Annu. ACM Sympos. Comput. Geom. (1998), pp. 19-28.
11. Mehlhorn, K. and Näher, S. 1999. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, U.K.
12. Mehlhorn, K., Näher, S., Seel, M., Seidel, R., Schilz, T., Schirra, S., and Uhrig, C. 1999. Checking geometric programs or verification of geometric structures. Comput. Geom. Theory Appl. 12, 85-103.
13. Mehlhorn, K., Näher, S., Seel, M., and Uhrig, C. The LEDA user manual. http://www.inpi-3b.inpg.de/LEDA/MANUAL/MANUAL.htinl: Max-Planck-Institute for Computer Science.
14. Peeparata, F. P. and Shamos, M. I. 1988. Computational Geometry: An Introduction. Springer-Verlag, New York, NY.
15. Ramsey, N. 1994. Literate programming simplified. IEEE Software 11, 97-105.
16. Schwerdt, J. and Smid, M. 1999. Computing the width of a three-dimensional point set: documentation. Report 4, Department of Computer Science, University of Magdeburg, Magdeburg, Germany, http://isgwww.cs.uni-magdeburg.de/'schwerdt/Cwidth.ps.
17. Schwerdt, J., Smid, M., Janardan, R., and Johnson, E. 2000. Protecting critical facets in layered manufacturing: implementation and experimental results. In Proc. 2nd Workshop on Algorithm Engineering and Experiments (2000), pp. 43-57.
18. Schwerdt, J., Smid, M., Janardan, R., Johnson, E., and Majhi, J. 1999. Protecting facets in layered manufacturing. In Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci., Volume 1738 of Lecture Notes Comput. Sci. (1999), pp. 281-292. Springer-Veriag.
19. Stolfi, J. 1991. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, New York, NY.