Computational geometry for the gourmet old fare and new dishes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 18th International Colloquium, Proceedings
EditorsJavier Leach Albert, Mario Rodriguez Artalejo, Burkhard Monien
PublisherSpringer Verlag
Pages686-696
Number of pages11
ISBN (Print)9783540542339
DOIs
StatePublished - 1991
Externally publishedYes
Event18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 - Madrid, Spain
Duration: Jul 8 1991Jul 12 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume510 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991
Country/TerritorySpain
CityMadrid
Period7/8/917/12/91

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Computational geometry for the gourmet old fare and new dishes'. Together they form a unique fingerprint.

Cite this