Results 11 to 20 of about 117,700 (279)
Shortest path in a polygon using sublinear space [PDF]
Journal of Computational Geometry, 2015 We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time.
Sariel Har-Peled
doaj +5 more sources
Packing identical simple polygons is NP-hard [PDF]
, 2012 Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.
Sarah R. Allen, John Iacono
openalex +3 more sources
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete [PDF]
, 2015 Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation.
Oswin Aichholzer +2 more
openalex +3 more sources
New Algorithm of Joining a Set of Segments into a Simple Polygon
Journal of Harbin University of Science and Technology, 2018 For the problem of how to link a set of segments to a simple polygon with the shortest whole length, a sufficient condition that a given set of segments can be joined into a simple polygon is given.It is proved that the nearest point or second nearest ...
JIN Hui, LIU Run-tao
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
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
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
Memory-Constrained Algorithms for Simple Polygons [PDF]
, 2011 A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of $O(\log n)$ bits, where $n$ is the size of the input. We assume that a simple $n$-gon is given by the ordered sequence of its vertices.
André Schulz +34 more
core +7 more sources
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
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