Mathematical snapshots from the computational geometry landscape

MaRDI QIDQ1126830zbMATH OpenFDO

Authors Jiří Matoušek

Publication date 5 August 1998

Published in Documenta Mathematica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/49861, http://www.emis.de/journals/DMJDMV/xvol-icm/13/Matousek.MAN.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

arrangementcomputational geometryDavenport-Schinzel sequenceorders of complexity

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

The author gives a survey of estimates of orders of complexity of several structures prominent in computational geometry, such as arrangements connected with Davenport-Schinzel sequences and Heilbronn's problem. A reasonably full bibliography is given for each of the problems treated.

Cited in

(2)

• SAGA -- Advances in ShApes, geometry, and algebra. Results from the Marie Curie initial training network, March 2008 -- October 2012
• scientific article; zbMATH DE number 4090789 (Why is no real title available?)

This page was built for publication: Mathematical snapshots from the computational geometry landscape

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126830)