Publication detail
Geometric Structures for Solving Network Optimisation Problems
ŠEDA, M.
Czech title
Geometrické struktury pro řešení úloh síťové optimalizace
English title
Geometric Structures for Solving Network Optimisation Problems
Type
conference paper
Language
en
Original abstract
This paper deals with fundamental structures of computational geometry, the Voronoi diagram, and its geometric dual, the Delaunay triangulation. They arise naturally in various branches of science. This paper surveys their basic properties and possible use for solving selected network optimisation problems.
Czech abstract
Příspěvek se zabývá základními strukturami počítačové geometrie Voronoiovým diagramem a jeho geometrickým duálním útvarem Delaunayho triangulací. Obě struktury mají aplikace v mnoha odvětvích vědy. Příspěvek shrnuje základní vlastnosti a možné použití pro řešení vybraných problémů síťové optimalizace.
English abstract
This paper deals with fundamental structures of computational geometry, the Voronoi diagram, and its geometric dual, the Delaunay triangulation. They arise naturally in various branches of science. This paper surveys their basic properties and possible use for solving selected network optimisation problems.
Keywords in English
Voronoi diagram, Delaunay triangulation, spanning tree, Steiner tree
RIV year
2005
Released
24.05.2005
Publisher
University of Miskolc
Location
Miskolc-Lillafüred (Hungary)
ISBN
963-661-645-0
Book
Proceedings of the 6th International Carpathian Control Conference ICCC ’2005
Pages count
6
BIBTEX
@inproceedings{BUT15918,
author="Miloš {Šeda},
title="Geometric Structures for Solving Network Optimisation Problems",
booktitle="Proceedings of the 6th International Carpathian Control Conference ICCC ’2005",
year="2005",
month="May",
publisher="University of Miskolc",
address="Miskolc-Lillafüred (Hungary)",
isbn="963-661-645-0"
}