Skip to search formSkip to main contentSkip to account menu

CGAL

Known as: Computational Geometry Algorithms Library 
The Computational Geometry Algorithms Library (CGAL) is a software library of computational geometry algorithms. While primarily written in C… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We study how to dynamize the Trapezoidal Search Tree - a well known randomized point location structure for planar subdivisions… 
2017
2017
This paper is focused on the analysis and comparison of different data structures for 3D space representation in autonomous… 
2013
2013
Convex maps were first introduced by Hillier and Hanson in “The social logic of space”, and have since become a standard diagram… 
2011
2011
We analyze, implement, and evaluate a distribution- sensitive point location algorithm based on the classical Jump & Walk, called… 
2008
2008
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients… 
2007
2007
The Bentley Ottmann sweep line algorithm is a standard tool to compute the arrangement of algebraic curves in the plane. If… 
2004
2004
Voronoi diagrams are one of the most fundamental and useful constructs in computational geometry. In this talk we focus on the… 
1982
1982
This paper describes the Computerized Gate Array Layout system (CGAL), a general purpose cool developed at Sperry Univac to…