A workbench for computational geometry
type: Item
instance of: scholarly article
title: A workbench for computational geometry
zbMATH Open document ID: 0804.68148
DOI: 10.1007/BF01187021
author: V. Pereyra
published in: Algorithmica
publication date: 1994-05-05T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 563271
zbMATH Keywords: computational geometry
zbMATH Keywords: implementation
zbMATH Keywords: algorithms
describes a project that uses: LEDA
describes a project that uses: Smalltalk
describes a project that uses: GeoBench
MaRDI profile type: Publication
Wikidata QID: Q62037500
cites work: An optimal algorithm for constructing the weighted Voronoi diagram in the plane
cites work: Generating binary trees at random
cites work: Uniform generation of forests of restricted height
cites work: Q3772828
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Triangulating Simple Polygons and Equivalent Problems
cites work: Q3667910
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: Triangulating a simple polygon
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: A new data structure for representing sorted lists
cites work: Sorting jordan sequences in linear time using level-linked search trees
cites work: On the identification of the convex hull of a finite set of points in the plane
cites work: Optimal Search in Planar Subdivisions
cites work: Visibility of a simple polygon
cites work: On-line construction of the convex hull of a simple polyline
cites work: Connect-the-dots: A new heuristic
cites work: A New Approach to Planar Point Location
cites work: Self-adjusting binary search trees
cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
description: scientific article; zbMATH DE number 563271