On a class of \(O(n^ 2)\) problems in computational geometry
type: Item
instance of: scholarly article
title: On a class of \(O(n^ 2)\) problems in computational geometry
zbMATH Open document ID: 0839.68105
DOI: 10.1016/0925-7721(95)00022-2
author: Anka Gajentaan
author: Mark H. Overmars
published in: Computational Geometry
publication date: 1995-12-12T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 825267
zbMATH Keywords: computational geometry
zbMATH Keywords: 3SUM-hard problems
zbMATH Keywords: motion planning
MaRDI profile type: Publication
full work available at URL: 0925-7721(95)00022-2
OpenAlex ID: W4213071546
Wikidata QID: Q56288896
cites work: Filling polyhedral molds.
cites work: Triangulating a simple polygon in linear time
cites work: Q3772828
cites work: Topologically sweeping an arrangement
cites work: The complexity and construction of many faces in arrangements of lines and of segments
cites work: On the union of fat wedges and separating a collection of segments by a line
cites work: Better lower bounds on detecting affine and spherical degeneracies
cites work: Fat Triangles Determine Linearly Many Holes
cites work: COMPUTATIONAL GEOMETRY COLUMN 22
cites work: Q3992847
cites work: The complexity of the free space for a robot moving amidst fat obstacles
cites work: The visibility diagram: A data structure for visibility problems and motion planning
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
description: scientific article; zbMATH DE number 825267