Detail publikace

Applications of Computational Geometry

ŠEDA, M.

Originální název

Applications of Computational Geometry

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

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

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

Autoři

ŠEDA, M.

Rok RIV

2007

Vydáno

1. 9. 2007

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

1

Strany do

6

Strany počet

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"
}