Results 21 to 30 of about 5,737 (222)
Visibility-monotonic polygon deflation
Contributions to Discrete Mathematics, 2015 A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show that the least n for which there exists such an n-gon is seven.
Bose, Prosenjit +3 more
openaire +2 more sources
A priori filtration of points for finding convex hull
Technological and Economic Development of Economy, 2006 Convex hull is the minimum area convex polygon containing the planar set. By now there are quite many convex hull algorithms (Graham Scan, Jarvis March, QuickHull, Incremental, Divide‐and‐Conquer, Marriage‐before‐Conquest, Monotone Chain, Brute Force ...
Laura Vyšniauskaitė +1 more
doaj +1 more source
Optimal Morphs of Convex Drawings [PDF]
, 2015 We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity.
Angelini, Patrizio +5 more
core +2 more sources
Space-Time Trade-offs for Stack-Based Algorithms [PDF]
, 2013 In memory-constrained algorithms we have read-only access to the input, and the number of additional variables is limited. In this paper we introduce the compressed stack technique, a method that allows to transform algorithms whose space bottleneck is a
Barba, Luis +4 more
core +4 more sources
Rotationally monotone polygons
Computational Geometry, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bose, Prosenjit +3 more
openaire +2 more sources
, 2015 We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane.
Dumitrescu, Adrian +3 more
core +1 more source
Extremal properties for dissections of convex 3-polytopes [PDF]
, 1999 A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices forms a ...
Bruns Winfried +6 more
core +5 more sources
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
Covering a Simple Polygon by Monotone Directions
Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahn, HK +4 more
openaire +4 more sources
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths [PDF]
, 2018 When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings?
Abel, Zachary +5 more
core +2 more sources