Results 21 to 30 of about 148,856 (241)
PSEUDO-TRIANGULATION OF MONOTONE POLYGON USING SWEEP LINE ALGORITHM
Khulna University Studies, 2022 In the field of computational geometry, pseudo-triangulation of a polygon is an interesting topic. Breaking a polygon into pseudo-triangles reduces the calculation cost and increases computational power.
S.M. Azoad Ahnaf +2 more
openalex +3 more sources
Convexifying Monotone Polygons while Maintaining Internal Visibility [PDF]
European Grid Conference, 2012 Let P be a simple polygon on the plane. Two vertices of P are visible if the open line segment joining them is contained in the interior of P. In this paper we study the following questions posed in [8,9]: (1) Is it true that every non-convex simple polygon has a vertex that can be continuously moved such that during the process no vertex-vertex ...
Gelasio Salazar +5 more
openaire +3 more sources
Modem illumination of monotone polygons
, 2009 We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these objects k-modems and study the minimum number of k-modems necessary to illuminate monotone and monotone ...
Oswin Aichholzer +6 more
openalex +2 more sources
Approximating monotone polygonal curves using the uniform metric [PDF]
Proceedings of the twelfth annual symposium on Computational geometry - SCG '96, 1996 Kasturi Varadarajan
openalex +3 more sources
Minimum Star Partitions of Simple Polygons in Polynomial Time [PDF]
Symposium on the Theory of Computing, 2023 We devise a polynomial-time algorithm for partitioning a simple polygon P into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint, Pattern Recognit ...
Mikkel Abrahamsen +3 more
semanticscholar +1 more source
Visibility-monotonic polygon deflation [PDF]
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.
Pat Morin +3 more
openaire +2 more sources
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
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
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
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