A new duality result concerning Vornonoi diagrams

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationInternational Colloquium on Automata, Languages and Programming
Publisher.
Pages21-32
DOIs
Publication statusPublished - 1986

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

Aurenhammer, F. (1986). A new duality result concerning Vornonoi diagrams. In International Colloquium on Automata, Languages and Programming (pp. 21-32). .. https://doi.org/10.1007/3-540-16761-7_51

A new duality result concerning Vornonoi diagrams. / Aurenhammer, Franz.

International Colloquium on Automata, Languages and Programming. ., 1986. p. 21-32.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Aurenhammer, F 1986, A new duality result concerning Vornonoi diagrams. in International Colloquium on Automata, Languages and Programming. ., pp. 21-32. https://doi.org/10.1007/3-540-16761-7_51
Aurenhammer F. A new duality result concerning Vornonoi diagrams. In International Colloquium on Automata, Languages and Programming. . 1986. p. 21-32 https://doi.org/10.1007/3-540-16761-7_51
Aurenhammer, Franz. / A new duality result concerning Vornonoi diagrams. International Colloquium on Automata, Languages and Programming. ., 1986. pp. 21-32
@inproceedings{dfeef1c9b90846348426e910e8fdca85,
title = "A new duality result concerning Vornonoi diagrams",
author = "Franz Aurenhammer",
year = "1986",
doi = "https://doi.org/10.1007/3-540-16761-7_51",
language = "English",
pages = "21--32",
booktitle = "International Colloquium on Automata, Languages and Programming",
publisher = ".",

}

TY - GEN

T1 - A new duality result concerning Vornonoi diagrams

AU - Aurenhammer, Franz

PY - 1986

Y1 - 1986

U2 - https://doi.org/10.1007/3-540-16761-7_51

DO - https://doi.org/10.1007/3-540-16761-7_51

M3 - Conference contribution

SP - 21

EP - 32

BT - International Colloquium on Automata, Languages and Programming

PB - .

ER -