Attributes | Values |
---|
rdf:type
| |
Description
| - This paper clearly describes one of the possible constructions of the Voronoi diagram for n point generators using Fortune’s plane sweep algorithm computing in O(n log n) worst-time complexity. This paper aims to aid optimal implementation with thorough documentation, providing a guide through the several possibilities of implementation to choose from, and includes some techniques for better practical realization.
- This paper clearly describes one of the possible constructions of the Voronoi diagram for n point generators using Fortune’s plane sweep algorithm computing in O(n log n) worst-time complexity. This paper aims to aid optimal implementation with thorough documentation, providing a guide through the several possibilities of implementation to choose from, and includes some techniques for better practical realization. (en)
- Článek zřetelně popisuje jednu z možných konstrukcí Voroného diagramu pro bodové generátory užitím Fortuneho zametacího algoritmu s časovou složitostí O(n log n). Účelem článku je pomoci s optimální implementací tohoto algoritmu jeho podrobným popisem, poskytujícím příručku pro několik možností implementace, a zároveň zahrnuje techniky pro robustnější praktickou realizaci. (cs)
|
Title
| - A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm
- A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm (en)
- Konstrukce 2D zobecněného Voroného diagramu, část II: Výsledky implementace Fortuneho zametacího algoritmu (cs)
|
skos:prefLabel
| - A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm
- A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm (en)
- Konstrukce 2D zobecněného Voroného diagramu, část II: Výsledky implementace Fortuneho zametacího algoritmu (cs)
|
skos:notation
| - RIV/00216305:26210/06:PU65949!RIV07-MSM-26210___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26210/06:PU65949
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Voronoi diagram, Fortune’s plane sweep algorithm (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| - Brno University of Technology
|
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Proceedings of the 12th International Conference on Soft Computing MENDEL 2006
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| |
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |