Results 21 to 30 of about 346,915 (178)
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2012 Molecular shape is one of the most critical factors that determines molecular function. Therefore, it is frequently desirable to understand geometric characteristics of a molecule more precisely and efficiently. In this paper, we introduce the BetaMol, a
Youngsong CHO +6 more
doaj +1 more source
Benchmark dataset for the convex hull of 2D disks
Data in Brief, 2019 In this paper, we present a benchmark dataset which can be used to evaluate the algorithms to construct the convex hull of 2D disks. The dataset contains disk arrangements including general and extremely biased cases, which are generated by a C++ program.
Chanyoung Song +2 more
doaj +1 more source
Three dimensional extension of Bresenham’s algorithm with Voronoi diagram [PDF]
, 2010 Bresenham’s algorithm for plotting a two-dimensional line segment is elegant and efficient in its deployment of mid-point comparison and integer arithmetic. It is natural to investigate its three-dimensional extensions.
Woo, Tony +3 more
core +1 more source
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2020 An algorithm is proposed for constructing a generalized Voronoi diagram with optimal placement of a finite number of generator points in a bounded set of n-dimensional Euclidean space.
О.М. Кісельова +2 more
doaj +1 more source
Generation of LDPM structure formed by Voronoi cells
Acta Polytechnica CTU Proceedings, 2023 A preliminary study of an approach to internal structure generation used in lattice discrete particle models (LDPMs) [1]. The presented method used for particle generation and placement is intended to help realistically capture the internal structure of
Jan Vozáb, Jan Vorel
doaj +1 more source
Computational Geometry, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marisa Mazón, Tomás Recio
openaire +2 more sources
longavailable/voronoi-diagram-for-polygons
, 2020 Voronoi diagram for polygons is a tool to create a Voronoi diagram also known as Thiessen polygons for polygons. It's based on Shapely and GeoPandas. There are lots of tools to create a Voronoi diagram for points, for example Create Thiessen Polygons ...
Xiaolong Liu, Meixiu Yu
core +1 more source
International Journal of Distributed Sensor Networks, 2022 Large-scale deployment of mobile wireless sensor networks has been widely used in some dangerous and hostile urban security surveillance scenarios. As a new network architecture, software-defined networks was introduced into wireless sensor networks to ...
Minghua Wang, Ran Ou, Yan Wang
doaj +1 more source
The voronoi diagram of three lines [PDF]
Proceedings 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]
Computational 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