Results 21 to 30 of about 223,659 (257)

Voronoi supported communication in Wireless ad-hoc Networks

open access: yes, 2005
The Voronoi Diagram, as well as its dual the Delaunay Triangulation, is a fundamental structure in computational geometry. They arise in many different fields of science, engineering and art.
Stratil, Hannes
core   +4 more sources

Application of Voronoi Diagram to School Districts in Shizuoka Prefecture

open access: yesEngineering Proceedings, 2023
Comparing the distribution of school districts in Shizuoka Prefecture with a Voronoi diagram generated for school locations, the application of Voronoi diagrams to the field of urban planning is pursued.
Kenji Sato, Haruno Ishikawa
doaj   +1 more source

MULTI-AGENT SIMULATION OF ALLOCATING AND ROUTING AMBULANCES UNDER CONDITION OF STREET BLOCKAGE AFTER NATURAL DISASTER [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2017
In response to natural disasters, efficient planning for optimum allocation of the medical assistance to wounded as fast as possible and wayfinding of first responders immediately to minimize the risk of natural disasters are of prime importance.
S. Azimi, M. R. Delavar, A. Rajabifard
doaj   +1 more source

Voronoi Tessellations and the Shannon Entropy of the Pentagonal Tilings

open access: yesEntropy, 2023
We used the complete set of convex pentagons to enable filing the plane without any overlaps or gaps (including the Marjorie Rice tiles) as generators of Voronoi tessellations. Shannon entropy of the tessellations was calculated.
Edward Bormashenko   +4 more
doaj   +1 more source

Voronoi Diagrams on orbifolds

open access: yesComputational Geometry, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marisa Mazón, Tomás Recio
openaire   +2 more sources

Diagramas de Voronoi para a definição de áreas de abrangência de hospitais públicos no Município do Rio de Janeiro Defining catchment areas for public hospitals in the Municipality of Rio de Janeiro through Weighted Voronoi Diagrams

open access: yesCadernos de Saúde Pública, 2000
No planejamento de recursos em saúde é importante o conhecimento da área de abrangência de uma unidade. Os Diagramas de Voronoi constituem uma técnica para tal; são polígonos construídos de tal forma que as bordas de polígonos adjacentes encontram-se ...
Flavio Astolpho Vieira Souto Rezende   +2 more
doaj   +1 more source

Voronoi diagrams – inventor, method, applications

open access: yesPolish Cartographical Review, 2018
The article presents the person and works of Georgy Voronoi (1868-1908), the inventor of an original method of diagrams, a student of the famous mathematician Andrey Markov.
Pokojski Wojciech, Pokojska Paulina
doaj   +1 more source

Exploration of nature-based biomimetic approach in landscape architectural design: parametric study of candelabra model design

open access: yesVisual Computing for Industry, Biomedicine, and Art, 2020
This research provides an exploration of a biomimetic approach in the process of designing a candelabra model using linear shaped leaves of a Bell flower. The design process described in this research contains two steps: biological and geometrical.
Biljana S. Jović, Anđela D. Mitić
doaj   +1 more source

The voronoi diagram of three lines [PDF]

open access: yesProceedings of the twenty-third annual symposium on Computational geometry - SCG '07, 2007
We give a complete description of the Voronoi diagram of three lines in $\R^3$. In particular, we show that the topology of the Voronoi diagram is invariant for three lines in general position, that is, that are pairwise skew and not all parallel to a common plane. The trisector consists of four unbounded branches of either a non-singular quartic or of
Everett, Hazel   +3 more
openaire   +7 more sources

Farthest-Polygon Voronoi Diagrams [PDF]

open access: yesComputational Geometry, 2007
Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log^3 n) time algorithm to compute it.
Otfried Cheong   +7 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy