Results 21 to 30 of about 117,700 (279)
Geodesic-Preserving Polygon Simplification [PDF]
, 2013 Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve
Aichholzer, Oswin +4 more
core +1 more source
Sensors, 2019 To cover an area of interest by an autonomous vehicle, such as an Unmanned Aerial Vehicle (UAV), planning a coverage path which guides the unit to cover the area is an essential process.
Lasse Damtoft Nielsen +2 more
doaj +1 more source
Weak Visibility Queries of Line Segments in Simple Polygons [PDF]
, 2012 Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the visibility polygon
Chen, Danny Z., Wang, Haitao
core +1 more source
A simple algorithm for calculating the area of an arbitrary polygon
Ruhuna Journal of Science, 2017 Computing the area of an arbitrary polygon is a popular problem in pure mathematics. The two methods used are Shoelace Method (SM) and Orthogonal Trapezoids Method (OTM).
K.R. Wijeweera, S.R. Kodituwakku
doaj +1 more source
Convolutional Neural Network-Based Approximation of Coverage Path Planning Results for Parking Lots
ISPRS International Journal of Geo-Information, 2023 Parking lots have wide variety of shapes because of surrounding environment and the objects inside the parking lot, such as trees, manholes, etc. In the case of paving the parking lot, as much area as possible should be covered by the construction ...
Andrius Kriščiūnas +5 more
doaj +1 more source
Pre-determination of prediction of yield-line pattern of slabs using Voronoi diagrams
Open Engineering, 2022 The article presents a new method of predicting the yield-lines of statically loaded slabs, based on roof geometry (straight skeletons) and Voronoi diagrams for a polygon.
Koźniewski Edwin, Orłowski Marcin
doaj +1 more source
New results on stabbing segments with a polygon [PDF]
, 2015 We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element
Díaz Bañez, José Miguel +5 more
core +2 more sources
Multiscale structural analysis of defective graphene in transmission electron microscopy images using persistent homology [PDF]
APL MaterialsWe developed a persistent-homology-based strategy that converts transmission electron microscopy images of defective graphene into quantitative, multiscale descriptors spanning local carbon-atom polygons and their global connectivity.
Ryuto Eguchi, Ayako Hashimoto
doaj +1 more source
On Reconfiguring Tree Linkages: Trees can Lock [PDF]
, 2000 It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex.
Biedl, Therese +9 more
core +10 more sources
A Spatially Bounded Airspace Axiom
Axioms, 2022 Free Route Airspace (FRA), a new concept implemented across European airspace, is designed to eliminate the adverse effects of air traffic, reduce fuel consumption, simplify and expand flight planning.
Peter Szabó +2 more
doaj +1 more source