Results 31 to 40 of about 4,255,094 (265)
Enumeration of the Additive Degree–Kirchhoff Index in the Random Polygonal Chains
Axioms, 2022 The additive degree–Kirchhoff index is an important topological index. This paper we devote to establishing the explicit analytical expression for the simple formulae of the expected value of the additive degree–Kirchhoff index in a random polygon. Based
Xianya Geng, Wanlin Zhu
doaj +1 more source
Detecting Weakly Simple Polygons [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014 25 pages and 13 figures, submitted to SODA ...
Chao Xu, Hsien-Chih Chang, Jeff Erickson
openaire +4 more sources
Generalized Petersen graphs and Kronecker covers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The family of generalized Petersen graphs $G(n,k)$, introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. The
Matjaž Krnc, Tomaž Pisanski
doaj +1 more source
Cálculo del área de un polígono simple
Modelling in Science Education and Learning, 2012 In the present paper we consider to determine the relative position between a point and a simple polygon in a plane. For this purpose we build a model of the polygon, which manipulation carries us, in a very natural way, to the solution of this problem ...
Francisco Arteaga
doaj +1 more source
On $r$-Guarding Thin Orthogonal Polygons [PDF]
, 2016 Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a point $q$ if ...
Biedl, Therese, Mehrabi, Saeed
core +2 more sources
An Optimal Algorithm for the Separating Common Tangents of two Polygons [PDF]
, 2015 We describe an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies to the same side of the ...
Abrahamsen, Mikkel
core +3 more sources
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
Convex Tours of Bounded Curvature [PDF]
, 1999 We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple
Boissonnat, Jean-Daniel +4 more
core +5 more sources
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