Roberto Tamassia, Luca Vismara, James E. Baker  Home/Search
Context Related
| dsi.unive.it/~wae97/proce...pap14.ps.gz Cached: PS.gz PS PDF DjVu Image Update Help From: dsi.unive.it/~wae97/pr...contents (more) Homepages: R.Tamassia L.Vismara J.Baker [2] [3] [4] HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
Abstract: The GeomLib project addresses the important objective of developing an easy to use, reliable, and open library of robust and efficient geometric algorithms. This paper is a preliminary report on the project. We present here the criteria that have inspired the preliminary design of GeomLib, and discuss the guidelines that we have followed in the initial implementation. We exemplify the innovative aspects of our design through the discussion of a vertical case study. (Update)
Context of citations to this paper: More
.... oriented programming and design patterns, to the area of design and implementation of data structures and algorithms (see, e.g. [19, 18]) Traditionally, algorithms have been implemented in a way that would maximize their e#ciency, which frequently meant sacrificing...
...projects have been written based on the research version of the library, as well. Various point location algorithms have been implemented [19]. A planar map (an embedded planar graph, or EPG) has been implemented [11] with operations that preserve planarity. The EPG is built on...
Cited by: More
Accessing the Internal Organization of Data.. - Goodrich, Handy.. (1999) (Correct)
Algorithmic Patterns for Orthogonal Graph Drawing - Gelfand, Tamassia (1998) (Correct)
Similar documents (at the sentence level):
6.9%: A Case Study in Algorithm Engineering for Geometric Computing - Tamassia, Vismara (1997) (Correct)
Active bibliography (related documents): More All
0.3: Designing a Computational Geometry Algorithms Library - Schirra (1996) (Correct)
0.2: Higher-dimensional Convex Hulls and Delaunay.. - Mehlhorn, Müller.. (1996) (Correct)
0.2: Robust Proximity Queries in Implicit Voronoi Diagrams - Liotta, Preparata, Tamassia (1996) (Correct)
Similar documents based on text: More All
0.1: On-Line Convex Planarity Testing - Di Battista, Tamassia, Vismara (1995) (Correct)
0.1: Drawing Directed Acyclic Graphs: An Experimental Study - Di Battista, Garg.. (1996) (Correct)
0.1: The Hidden Group Structure Of Quantum Groups.. - Bonneau, Flato.. (1993) (Correct)
Related documents from co-citation: More All
3: Teaching data structures design patterns - Gelfand, Goodrich et al. - 1998
3: Reuse of algorithms: Still a challenge to object-oriented programming (context) - Weihe - 1997
3: Data Structures and Algorithms in JAVA (context) - Goodrich, Tamassia - 1998
BibTeX entry: (Update)
R. Tamassia, L. Vismara, and J. E. Baker. A case study in algorithm engineering for geometric computing. In G. F. Italiano and S. Orlando, editors, Proc. Workshop on Algorithm Engineering, 1997. http://www.dsi.unive.it/wae97/proceedings/. http://citeseer.nj.nec.com/article/tamassia97case.html More
@article{ tamassia01case,
author = "Roberto Tamassia and Luca Vismara",
title = "A Case Study in Algorithm Engineering for Geometric Computing",
journal = "International Journal of Computational Geometry and Applications",
volume = "11",
number = "1",
pages = "15-70",
year = "2001",
url = "citeseer.nj.nec.com/article/tamassia97case.html" }
Citations (may not include all citations):1262 Cambridge University Press (context) - Press, Flannery et al. - 1988
1102 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
280 Design Patterns (context) - Gamma, Helm et al. - 1995
253 LEDA: a platform for combinatorial and geometric computing - Mehlhorn, Naher - 1995
219 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
172 Cambridge University Press (context) - O'Rourke, in - 1994
100 Optimal point location in a monotone subdivision (context) - Edelsbrunner, Guibas et al. - 1986
79 volume 10 of EATCS Monographs on Theoretical Computer Scienc.. (context) - Edelsbrunner, Combinatorial - 1987
44 Location of a point in a planar subdivision and its applicat.. (context) - Lee, Preparata - 1977
38 Graphics Gems (context) - Glassner - 1990
37 The CGAL kernel: A basis for geometric computation - Fabri, Giezeman et al. - 1996
36 Exact geometric computation in LEDA - Burnikel, Konnemann et al. - 1995
32 Designing the Computational Geometry Algorithms Library CGAL (context) - Overmars - 1996
29 Checking geometric programs or verification of geometric str.. - Mehlhorn, Naher et al. - 1996
26 A new approach to planar point location (context) - Preparata - 1981
24 Robust proximity queries: An illustration of degree-driven a.. - Liotta, Preparata et al.
16 A new point-location algorithm and its practical efficiency .. (context) - Edahiro, Kokubo et al. - 1984
10 Planar point location revisited (context) - Preparata - 1990
7 Computational Geometry and Computer Graphics in C (context) - Laszlo - 1996
6 A probabilistic analysis of the power of arithmetic filters - Devillers, Preparata - 1996
5 line planar graph embedding (context) - Tamassia - 1996
4 A computational basis for higher-dimensional computational g.. (context) - Mehlhorn, Muller et al. - 1997
1 A software platform and network environment for geometric co.. (context) - Tamassia, Goodrich et al. - 1996
Documents on the same site (http://www.dsi.unive.it/~wae97/proceedings/contents.html): More
Reactive Local Search for Maximum Clique - Battiti, Protasi (1997) (Correct)
Database Learning: a Method for Empirical Algorithm Design - Goldberg, Hollinger (1997) (Correct)
A First Experimental Study of a Dynamic Transitive Closure.. - Miller, Zaroliagis (1997) (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute