Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,059,008 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
35 relations
Algorithm
Alpha shape
Application framework
C++
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions
Milutin Brankovic
,
N. Grujic
,
André van Renssen
,
Martin P. Seybold
International Colloquium on Automata, Languages…
2019
Corpus ID: 208909705
We study how to dynamize the Trapezoidal Search Tree - a well known randomized point location structure for planar subdivisions…
Expand
2018
2018
Finding Intersections of Algebraic curves in a Convex Region using Encasement
Joseph G. Masterjohn
,
V. Milenkovic
,
E. Sacks
Canadian Conference on Computational Geometry
2018
Corpus ID: 54747196
,
2013
2013
A Computational Method For Generating Convex Maps Using the Medial Axis Transform
P. Carranza.
,
D. Koch
2013
Corpus ID: 51761167
Convex maps were first introduced by Hillier and Hanson in “The social logic of space”, and have since become a standard diagram…
Expand
2011
2011
Simple and Efficient Distribution-Sensitive Point Location, in Triangulations
Pedro Machado Manhães de Castro
,
O. Devillers
Workshop on Algorithm Engineering and…
2011
Corpus ID: 13437199
We analyze, implement, and evaluate a distribution- sensitive point location algorithm based on the classical Jump & Walk, called…
Expand
2011
2011
Creating building ground plans via robust K-way union
Jyh-Ming Lien
,
F. Camelli
,
David W. S. Wong
,
Yanyan Lu
,
B. McWhorter
The Visual Computer
2011
Corpus ID: 9798766
Due to collaborative efforts and advances in data acquisition technology, a large volume of geometric models describing urban…
Expand
2008
2008
A Deterministic Descartes Algorithm for Real Polynomials
K. Mehlhorn
,
Michael Sagraloff
2008
Corpus ID: 17000918
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients…
Expand
2007
2007
Computations of Delaunay and Higher Order Triangulations, with Applications to Splines
J. Snoeyink
,
Yuanxin Liu
2007
Corpus ID: 117352839
Digital data that consist of discrete points are frequently captured and processed by scientific and engineering applications…
Expand
2007
2007
Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point
Eric Berberich
,
Lutz Kettner
2007
Corpus ID: 18317280
The Bentley Ottmann sweep line algorithm is a standard tool to compute the arrangement of algebraic curves in the plane. If…
Expand
1985
1985
Computer animation in interior and industrial design
P. Comninos
Computers & graphics
1985
Corpus ID: 6043902
1982
1982
CGAL - A Multi Technology Gate Array Layout System
Lee F. Todd
,
J. M. Hansen
,
+4 authors
A. Biyani
Design Automation Conference
1982
Corpus ID: 392966
This paper describes the Computerized Gate Array Layout system (CGAL), a general purpose cool developed at Sperry Univac to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE