Results 1 
6 of
6
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;
Animation of Geometric Algorithms: A Video Review
 DEC Systems Research Center, Research Report
, 1993
"... Geometric algorithms and data structures are often easiest to understand visually, in terms of the geometric objects they manipulate. Indeed, most papers in computational geometry rely on diagrams to communicate the intuition behind the results. Algorithm animation uses dynamic visual images to expl ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Geometric algorithms and data structures are often easiest to understand visually, in terms of the geometric objects they manipulate. Indeed, most papers in computational geometry rely on diagrams to communicate the intuition behind the results. Algorithm animation uses dynamic visual images to explain algorithms. Thus it is natural to present geometric algorithms, which are inherently dynamic, via algorithm animation. The accompanying videotape presents a video review of geometric animations; the review was premiered at the 1992 ACM Symposium on Computational Geometry. The video review includes singlealgorithm animations and sample graphic displays from "workbench" systems for implementing multiple geometric algorithms. This report contains short descriptions of each video segment. vi Preface This booklet and the accompanying videotape contain animations of a variety of computational geometry algorithms. Computational geometry has existed as a field for almost two decades, and int...
The Design of MMM: A Model ManageMent System for Time Series Analysis
 Proceedings of DAGS'95
, 1995
"... Time series analysis and prediction is turning into an interdisciplinary subject where data and methods are being contributed from a broad variety of disciplines, including economics, physics, computer science, and statistics. Model management systems were originally designed for operations research ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Time series analysis and prediction is turning into an interdisciplinary subject where data and methods are being contributed from a broad variety of disciplines, including economics, physics, computer science, and statistics. Model management systems were originally designed for operations research applications. With thousands of methods and gigabytes of data now available on the Internet, however, such systems may become a crucial component for the efficient organization and exchange of any computerbased work in these areas. This paper introduces the model management system MMM that combines model management with the World Wide Web (WWW) to provide an infrastructure for interdisciplinary, worldwide distributed research on time series analysis. In particular, MMM will provide a platform to make related research results applicable and verifiable. 1 Introduction With the increasing availability of highcapacity wide area computer networks, the sharing of data among distributed teams i...
Java Applets for the Dynamic Visualization of Voronoi Diagrams
, 2003
"... This paper is dedicated to Thomas Ottmann on the occasion of his 60th birthday. We discuss the design of several Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying distance function is changed ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper is dedicated to Thomas Ottmann on the occasion of his 60th birthday. We discuss the design of several Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying distance function is changed. Moreover, we report on some experiences made in using these applets in teaching and research. The applets can be found and tried out at http://wwwpi6.fernunihagen.de/GeomLab/.
An Optimal Algorithm for Realizing a Delaunay
"... Abstract Dillencourt [7] gives a constructive proof for the realizability as a Delaunay triangulation of any triangulation of the interior of a simple polygon. A naive implementation of the construction will take O(n 2) time. I give a simple O(n) algorithm for this problem. An application of this al ..."
Abstract
 Add to MetaCart
Abstract Dillencourt [7] gives a constructive proof for the realizability as a Delaunay triangulation of any triangulation of the interior of a simple polygon. A naive implementation of the construction will take O(n 2) time. I give a simple O(n) algorithm for this problem. An application of this algorithm is generating test data for algorithms that process convex polygons.
Extending a Library for Geometric Computation to Provide Network Services: A Case Study
, 1995
"... In today's world of intercomputer communication across highspeed links it is often more efficient to make program libraries available by remote access than by porting to other systems. The main reason is that both, libraries and systems, evolve and require continued maintenance, and this is best d ..."
Abstract
 Add to MetaCart
In today's world of intercomputer communication across highspeed links it is often more efficient to make program libraries available by remote access than by porting to other systems. The main reason is that both, libraries and systems, evolve and require continued maintenance, and this is best done in one place to avoid divergence. Geometric computation has wideranging applications in many fields that process spatial data, such as computeraided design (CAD) or geographic information systems (GIS). The implementation of efficient and robust algorithms to process spatial data cannot be left to application programmers, it requires experts in computational geometry. Yet there are only a few program libraries for geometric computation available, and none is accessible as a geometry server. We have extended our XYZ GeoBench and program library to provide network services and make it accessible as a GeoServer. We investigate how a library for geometric computation can be accessed by spa...