Results 1 
5 of
5
On the design of CGAL a computational geometry algorithms library
 Softw. – Pract. Exp
, 1998
"... CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. We discuss the major ..."
Abstract

Cited by 90 (15 self)
 Add to MetaCart
CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. We discuss the major design goals for CGAL, which are correctness, flexibility, easeofuse, efficiency, and robustness, and present our approach to reach these goals. Generic programming using templates in C++ plays a central role in the architecture of CGAL. We give a short introduction to generic programming in C++, compare it to the objectoriented programming paradigm, and present examples where both paradigms are used effectively in CGAL. Moreover, we give an overview of the current structure of the CGALlibrary and consider software engineering aspects in the CGALproject. Copyright c ○ 1999 John Wiley & Sons, Ltd. KEY WORDS: computational geometry; software library; C++; generic programming;
Making Geometry Visible: An introduction to the Animation of Geometric Algorithms
, 1997
"... ion There are times when the amount of data produced by a program overwhelms the user. When this happens, an animation confuses more than it educates. If the algorithm is complex, and uses several different data structures and subalgorithms, the user may get lost in the details and not see the ov ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
ion There are times when the amount of data produced by a program overwhelms the user. When this happens, an animation confuses more than it educates. If the algorithm is complex, and uses several different data structures and subalgorithms, the user may get lost in the details and not see the overall picture. In such cases, the programmer should condense complicated parts of the scene into simpler items, like boxes. This is the approach taken in several videos we have reviewed. Time can also be abstracted, if several phases of an algorithm are omitted and only the final result of several program steps is presented. An ideal system should include facilities that help the programmer implement this sort of abstraction. Ideally, all the detail should be accessible to the user if he/she needs to see it. This is called semantic zooming. Sometimes, of course, it may be desirable to present the viewer with large amounts of information. This occurs when several sorts are simultaneously c...
The Prototyping Of Geomanager: A Geometric Algorithm Manipulation System
, 1995
"... Contents Acknowledgments ii 1 Introduction 1 1.1 Description of GeoMAMOS . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Description of GeoSheet and GeoIPC . . . . . . . . . . . . . . . . . . 2 1.3 Description of the Project . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3.1 Limitations of ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Contents Acknowledgments ii 1 Introduction 1 1.1 Description of GeoMAMOS . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Description of GeoSheet and GeoIPC . . . . . . . . . . . . . . . . . . 2 1.3 Description of the Project . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3.1 Limitations of the original configuration . . . . . . . . . . . . 3 1.3.2 The solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3.3 Implementation approaches . . . . . . . . . . . . . . . . . . . 3 2 Project Requirements 5 2.1 Transparency to the user . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Hardcoded algorithms in GeoSheet . . . . . . . . . . . . . . . . . . . 5 2.3 System independence . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3 Project Implementation 7 3.1 Function pointers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 GSArguments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.
DCEL: A Polyhedral Database And Programming Environment
, 1996
"... In this paper we describe the DCEL system: a geometric software package which implements a polyhedral programming environment. This package enables fast prototyping of geometric algorithms for polyhedra or for polyhedral surfaces. We provide an overview of the system's functionality and demonstrate ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we describe the DCEL system: a geometric software package which implements a polyhedral programming environment. This package enables fast prototyping of geometric algorithms for polyhedra or for polyhedral surfaces. We provide an overview of the system's functionality and demonstrate its use in several applications. Keywords: geometric software, databases, programming environments, polyhedra. 1. Introduction Computational geometry has offered a large amount of algorithms during the last two decades. Software implementation of these algorithms makes them valuable not only for theoreticians but also for practitioners in academia and industry. This is in many cases the appropriate tool for choosing the best algorithm for a specific problem in a given context: hardware platform, operating system, programming language, typical inputs of the application, robustness considerations, etc. The importance of applied computational geometry is now being recognized. 10 Dedicated ...
Geometric Algorithm Visualization, Current Status and Future
 Applied Computational Geometry, Lin and Manocha (Eds
, 1996
"... . We give a survey of the current status of geometric algorithm visualization and offer some suggestions regarding geometric software library and future directions for visualization software. 1 Introduction Since its inception two decades ago computational geometry has become a very active research ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We give a survey of the current status of geometric algorithm visualization and offer some suggestions regarding geometric software library and future directions for visualization software. 1 Introduction Since its inception two decades ago computational geometry has become a very active research field within theoretical computer science. There are a good number of research publications collected in pub/geometry/geombib.tar.Z, available via anonymous ftp from ftp.cs.usask.ca. Several journals dedicated to computational geometry have been established. The reader is encouraged to visit the Web page on Geometry in Action by D. Eppstein at http://www.ics.uci.edu/ ~eppstein/geom.html and computational geometry page by J. Erickson at http:// www.cs.berkeley.edu/~jeffe/compgeom.html for more information. Only recently an informal assessment of the impact of the field on other science and engineering disciplines was conducted and the questions of its relevance to practice were raised among...