Results 31 to 40 of about 4,303,118 (363)
Computational Geometry, 1997 AbstractWe consider the problem of verifying a simple polygon in the plane using “test points”. A test point is a geometric probe that takes as input a point in Euclidean space, and returns “+” if the point is inside the object being probed or “−” if it is outside.
Patrice Belleville +6 more
openaire +1 more source
Self-approaching paths in simple polygons [PDF]
Computational Geometry, 2020 We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points $a$, $b$, and $c$ that appear in that order along the curve, $|ac| \ge |bc ...
Bose, Prosenjit +2 more
openaire +8 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
Stabbing information of a simple polygon
Discrete Applied Mathematics, 1996 The purpose of this paper is to investigate a new combinatorial object describing the structure of a simple polygon and compare it to other well-known objects such as the internal and external visibility graphs, the convex hull and the order type of the vertex set. We call the new object the stabbing information.
Everett, Hazel +2 more
openaire +3 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
On compatible triangulations of simple polygons
Computational Geometry, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raimund Seidel +2 more
openaire +3 more sources
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
Gauss Digitization of Simple Polygons
, 2021 Digitization is a process of discretizing a continuous object $X ⊂ R 2$ to obtain a digital object $X ⊂ Z 2$. This document addresses the Gauss digitization of continuous objects. In particular, we are interested in computing the digitized object of simple polygons.
Phuc Ngo
openalex +4 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