Computational geometry in a curved world
type: Item
instance of: scholarly article
title: Computational geometry in a curved world
zbMATH Open document ID: 0696.68101
DOI: 10.1007/BF01840397
author: David P. Dobkin
author: Diane L. Souvaine
published in: Algorithmica
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68U99
Mathematics Subject Classification ID: 52A10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 4141542
zbMATH Keywords: curve algorithm
zbMATH Keywords: diameter decomposition
zbMATH Keywords: computational geometry
zbMATH Keywords: splinegon
zbMATH Keywords: splinehedron
zbMATH Keywords: convex hull computation
zbMATH Keywords: intersection detection
zbMATH Keywords: kernel computation
zbMATH Keywords: monotonicity testing
MaRDI profile type: Publication
cites work: Q3795221
cites work: Fast detection of polyhedral intersection
cites work: A linear algorithm for determining the separation of convex polyhedra
cites work: Q3479508
cites work: Detecting the intersection of convex objects in the plane
cites work: Decomposition and intersection of simple splinegons
cites work: Optimal Point Location in a Monotone Subdivision
cites work: Triangulating Simple Polygons and Equivalent Problems
cites work: Finding the convex hull of a simple polygon
cites work: Sorting jordan sequences in linear time using level-linked search trees
cites work: Optimal Search in Planar Subdivisions
cites work: Q3750096
cites work: An Optimal Algorithm for Finding the Kernel of a Polygon
cites work: A Separator Theorem for Planar Graphs
cites work: Q3219753
cites work: Curve Fitting with Conic Splines
cites work: Convex hulls of piecewise-smooth Jordan curves
cites work: Q4133127
cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
full work available at URL: https://doi.org/10.1007/bf01840397
OpenAlex ID: W2040904149
description: scientific article; zbMATH DE number 4141542