[Li 01] Chen Li. ―Exact Geometric Computation: Theory and Application.‖ Ph.D. dissertation, Department
of Computer Science, New York University, New York, 2001.
[Lindstrom and Pascucci 01] Peter Lindstrom and Valerio Pascucci. ―Visualization of Large Terrains Made
Easy.‖ In Proc. IEEE Visualization. San Diego, 2001.
[Lindstrom et al. 96] Peter Lindstrom, David Koller, William Ribarsky, Larry F. Hughes, Nick Faust, and
Gregory Turner. ―Real-Time, Continuous Level of Detail Rendering of Height Fields.‖ In SIGGRAPH 96
Conference Proceedings, edited by Holly Rushmeier, pp. 109–118. ACM SIGGRAPH, Addison Wesley,
1996.
[Liotta et al. 96] Giuseppe Liotta, Franco P. Preparata, and Roberto Tamassia. ―Robust Proximity Queries
in Implicit Voronoi Diagrams.‖ Technical Report CS-96-16, Center for Geometric Computing, Comput. Sci.
Dept., Brown Univ., Providence, RI, 1996.
[Lorensen and Cline 87] William E. Lorensen and Harvey E. Cline. ―Marching Cubes: A High Resolution
3D Surface Construction Algorithm.‖ In Computer Graphics (SIGGRAPH ’87 Proceedings), 21, edited by
Maureen C. Stone, 21, pp. 163–169, 1987.
[Maurer and Ottmann 79] H. A. Maurer and T. A. Ottmann. ―Dynamic Solutions of Decomposable
Searching Problems.‖ In Discrete Structures and Algorithms, edited by U. Pape, pp. 17–24. München,
Germany: Carl Hanser Verlag, 1979.
[McCreight 80] E. M. McCreight. ―Efficient Algorithms for Enumerating Intersecting Intervals and
Rectangles.‖ Report CSL-80-9, Xerox Palo Alto Res. Center, Palo Alto, CA, 1980.
[Mehlhorn and Näher 94] Kurt Mehlhorn and Stefan Näaher. ―The Implementation of Geometric
Algorithms.‖ In Proc. 13th World Computer Congress IFIP94, pp. 223–231, 1994.
[Mehlhorn and Näher 00] Kurt Mehlhorn and Stefan Näher. LEDA: A Platform for Combinatorial and
Geometric Computing. Cambridge, UK: Cambridge University Press, 2000.
[Mehlhorn and Overmars 81] K. Mehlhorn and M. H. Overmars. ―Optimal Dynamization of Decomposable
Searching Problems.‖ Inform. Process. Lett. 12 (1981), 93–98.
[Michael and Quint 03] T. S. Michael and Thomas Quint. ―Sphere of Influence Graphs and the L
∞
-Metric.‖
Discrete Applied Mathematics 127:3 (2003), 447 – 460.
[Michelucci and Moreau 97] D. Michelucci and J.-M. Moreau. ―Lazy Arithmetic.‖ IEEE Transactions on
Computers 46:9 (1997), 961–975.
[Michelucci 96] D. Michelucci. ―Arithmetic Isuues in Geometric Computations.‖ In Proc. 2nd Real Numbers
and Computer Conf., pp. 43–69, 1996.
[Michelucci 97] D. Michelucci. ―The Robustness Issue.‖ 1997. Available from World Wide Web
(http://citeseer.ist.psu.edu/361993.html).
[Mosaic a] ―Mosic from a Roman bath in Bath, UK.‖ Available from World Wide Web
(http://www2.sjsu.edu/depts/jwss/bath2004/baths.html).
[Mosaic b] ―Mosaic floor from a Late Roman bath, with main theme two peacocks enframing a vessel of
kantharos shape.‖ Available from World Wide Web
(http://www.culture.gr/2/21/211/21110m/e211jm04.html).
[Müller et al. 00] Gordon Müller, Stephan Schäfer, and W. Dieter Fellner. ―Automatic Creation of Object
Hierarchies for Radiosity Clustering.‖ Computer Graphics Forum 19:4.
[Naylor et al. 90] Bruce Naylor, John Amanatides, and William Thibault. ―Merging BSP Trees Yields
Polyhedral Set Operations.‖ In Computer Graphics (SIGGRAPH’90 Proceedings), 24, edited by Forest
Baskett, 24, pp. 115–124, 1990.
[Naylor 96] Bruve F. Naylor. ―A Tutorial on Binary Space Partitioning Trees.‖ ACM SIGGRAPH ’96 Course
Notes 29.