Results 31 to 40 of about 148,856 (241)
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
, 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
Drawing Planar Graphs with a Prescribed Inner Face [PDF]
, 2013 Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan +7 more
core +2 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
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
Testing a simple polygon for monotonicity optimally in parallel
[1993] Proceedings Seventh International Parallel Processing Symposium, 1993 We show that an \(n\)-vertex simple polygon can be tested in parallel for monotonicity optimally in \(O(\log n)\) time using \(n/\log n\) EREW PRAM processors, and we present two different optimal parallel algorithms for solving this problem. Our results leads to an optimal parallel algorithm for triangulating simple polygons that runs in \(O(\log n)\)
Chen, Danny Z., Guha, Sumanta
openaire +6 more sources
, 2010 We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem.
Aichholzer, Oswin +5 more
core +2 more sources
Coverage path planning considering the cell number and starting position
Xi'an Gongcheng Daxue xuebaoThe coverage tasks of mobile robots are evolving towards large-scale and intelligent directions, demanding urgent requirements for the coverage efficiency and environmental adaptability of coverage path planning. To address the inadequate adaptability of
MA Mingyan +4 more
doaj +1 more source
Deconstructing Approximate Offsets [PDF]
, 2011 We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius?
Berberich, Eric +3 more
core +2 more sources