Results 41 to 50 of about 18,277 (211)
Farthest-Polygon Voronoi Diagrams [PDF]
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.
Cheong, Otfried +7 more
openaire +3 more sources
Arm‐Length‐Controlled CsPbBr3 Nanocrystals for Tunable Optical and Assembly Behavior
In this work, the synthesis parameters that dictate the formation of armed CsPbBr3 nanocrystals are described, and routes enabling precise control over arm length are proposed. Direct links between morphology and optoelectronic behavior are established.
Irina Skvortsova +13 more
wiley +1 more source
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
In the Hausdorff Voronoi diagram of a family of \emph{clusters of points} in the plane, the distance between a point $t$ and a cluster $P$ is measured as the maximum distance between $t$ and any point in $P$, and the diagram is defined in a nearest ...
Cheilaris, Panagiotis +3 more
core +1 more source
This review outlines how understanding bone's biology, hierarchical architecture, and mechanical anisotropy informs the design of lattice structures that replicate bone morphology and mechanical behavior. Additive manufacturing enables the fabrication of orthopedic implants that incorporate such structures using a range of engineering materials ...
Stylianos Kechagias +4 more
wiley +1 more source
Applications of Voronoi Diagrams in Multi-Robot Coverage: A Review
In recent decades, multi-robot region coverage has played an important role in the fields of environmental sensing, target searching, etc., and it has received widespread attention worldwide.
Meng Zhou +4 more
doaj +1 more source
Higher Order City Voronoi Diagrams
We investigate higher-order Voronoi diagrams in the city metric. This metric is induced by quickest paths in the L1 metric in the presence of an accelerating transportation network of axis-parallel line segments.
Gemsa, Andreas +3 more
core +1 more source
FURTHEST SITE ABSTRACT VORONOI DIAGRAMS [PDF]
Voronoi diagrams were introduced by R. Klein as a unifying approach to Voronoi diagrams. In this paper we study furthest site abstract Voronoi diagrams and give a unified mathematical and algorithmic treatment for them. In particular, we show that furthest site abstract Voronoi diagrams are trees, have linear size, and that, given a set of n sites ...
Mehlhorn, K., Meiser, S., Rasch, R.
openaire +3 more sources
Sub‐Unit‐Cell Logic Governs Transport in TPMS Architectures
ABSTRACT Next‐generation energy, thermal, and chemical systems require architectures capable of highly efficient transport across multiple length scales. Triply periodic minimal surfaces (TPMS), first conceptualized in 1865, offer inherently scalable geometries with exceptional transport potential, yet mechanistic links between topology and performance
Haozhang Zhong +16 more
wiley +1 more source
Delimiting the service area of public facilities is an essential topic in spatial analysis studies. The adaptive crystal growth Voronoi diagrams based on weighted planes are one of the recently proposed methods to address service area delimitation, and ...
Jue Wang, Mei-Po Kwan
doaj +1 more source
Coverage improvement using Voronoi diagrams in directional sensor networks
Recently, the area coverage problem has emerged in the directional sensor network (DSN), where the sensor's sensed area depends on its working direction and viewing angle.
Zahra Zarei, Mozafar Bag‐Mohammadi
doaj +1 more source

