Results 1 to 10 of about 5,539 (72)
Lower Bound for Sculpture Garden Problem: Localization of IoT Devices
Applied Sciences, 2023 The purpose of the current study is to investigate a special case of art gallery problem, namely a sculpture garden problem. In this problem, for a given polygon P, the ultimate goal is to place the minimum number of guards (landmarks) to define the ...
Marzieh Eskandari +2 more
doaj +1 more source
Q-Curve and Area Rules for Choosing Heuristic Parameter in Tikhonov Regularization
Mathematics, 2020 We consider choice of the regularization parameter in Tikhonov method if the noise level of the data is unknown. One of the best rules for the heuristic parameter choice is the quasi-optimality criterion where the parameter is chosen as the global ...
Toomas Raus, Uno Hämarik
doaj +1 more source
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
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
Morphing Planar Graph Drawings Optimally [PDF]
, 2014 We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten +10 more
core +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
, 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
, 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
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