Detail publikace

Applications of Computational Geometry

ŠEDA, M.

Anglický název

Applications of Computational Geometry

Typ

Stať ve sborníku v databázi WoS či Scopus

Jazyk

en

Originální abstrakt

This paper deals with fundamental structures of computational geometry, the Voronoi diagram, and its geometric dual, the Delaunay triangulation. It surveys basic properties, algorithms for their construction and typical applications in network optimisation (Euclidean minimum spanning tree, Euclidean minimum Steiner tree) and robot motion planning in the plane with obstacles.

Klíčová slova anglicky

computational geometry, Delaunay triangulation, Voronoi diagram, Euclidean minimum spanning tree, Euclidean minimum Steiner tree

Vydáno

2007-09-01

Nakladatel

University of Maribor, Faculty of Electrical Engineering and Computer Science

Místo

Maribor (Slovenia)

ISBN

978-961-248-054-7

Kniha

Proceedings of CEEPUS WEB Summer School 2007 – "Information Systems in Automation"

Strany od–do

1–6

Počet stran

6

BIBTEX


@inproceedings{BUT28075,
  author="Miloš {Šeda}",
  title="Applications of Computational Geometry",
  booktitle="Proceedings of CEEPUS WEB Summer School 2007 - {"}Information Systems in Automation{"}",
  year="2007",
  pages="1--6",
  publisher="University of Maribor, Faculty of Electrical Engineering and Computer Science",
  address="Maribor (Slovenia)",
  isbn="978-961-248-054-7"
}