A workbench for computational geometry
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3821076 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- A New Approach to Planar Point Location
- A new data structure for representing sorted lists
- A sweepline algorithm for Voronoi diagrams
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- An efficient algorithm for determining the convex hull of a finite planar set
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Connect-the-dots: A new heuristic
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Generating binary trees at random
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the identification of the convex hull of a finite set of points in the plane
- On-line construction of the convex hull of a simple polyline
- Optimal Search in Planar Subdivisions
- Self-adjusting binary search trees
- Sorting jordan sequences in linear time using level-linked search trees
- Triangulating Simple Polygons and Equivalent Problems
- Triangulating a simple polygon
- Uniform generation of forests of restricted height
- Visibility of a simple polygon
Cited in
(7)- The geometry toolbox for graphics and modeling
- Geometric algorithm visualization, current status and future
- A software tool for the investigation of plane loci
- On the design of CGAL a computational geometry algorithms library
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- scientific article; zbMATH DE number 176582 (Why is no real title available?)
- A Singular web service for geometric computations
This page was built for publication: A workbench for computational geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322571)
