Results 151 to 160 of about 142,034 (198)

Decomposing a Polygon into Simpler Components

SIAM journal on computing (Print), 1985
The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntactic pattern recognition, and graphics. In this paper we consider decompositions which do not introduce Steiner points. The simpler
J. Keil
semanticscholar   +1 more source

Monotone labelings in polygonal tilings

Journal of Heuristics, 1997
Labeling the vertices of a finite sequence of polygonal tilings with fewest monotonicity violations enables to represent the tilings by merely specifying sets of vertices—the sequences of their appearance results from the labels. Eventually, this allows a lossless data compression for the sequence of tilings.
openaire   +2 more sources

Optimal uniformly monotone partitioning of polygons with holes

Computer-Aided Design, 2012
Polygon partitioning is an important problem in computational geometry with a long history. In this paper we consider the problem of partitioning a polygon with holes into a minimum number of uniformly monotone components allowing arbitrary Steiner points. We call this the MUMC problem.
Wei, Xiangzhi, Joneja, Ajay, Mount, David M.   +2 more
openaire   +2 more sources

GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA

International Journal of Computational Geometry & Applications, 2005
A simple polyhedron is weakly-monotonic in direction [Formula: see text] provided that the intersection of the polyhedron and any plane with normal [Formula: see text] is simply-connected (i.e. empty, a point, a line-segment or a simple polygon). Furthermore, if the intersection is a convex set, then the polyhedron is said to be weakly-monotonic in ...
Prosenjit Bose, Marc van Kreveld
openaire   +3 more sources

On Minimum Link Monotone Path Problems

Journal of Computing and Information Science in Engineering, 2011
The problem of finding monotone paths between two given points has useful applications in path planning, and in particular, it is useful to look for minimum link paths. We are given a simple polygon P or a polygonal domain D with n vertices and a triplet
Xiangzhi Wei, Ajay Joneja
semanticscholar   +1 more source

A counterexample to an algorithm for computing monotone hulls of simple polygons

Pattern Recognition Letters, 1983
A two-stage algorithm was recently proposed by Sklansky (1982) for computing the convex hull of a simple polygon P. The first step is intended to compute a simple polygon P^* which is monotonic in both the x and y directions and which contains the convex hull vertices of P. The second step applies a very simple convex hull algorithm on P^*.
Godfried T. Toussaint, Hossam A. El Gindy   +1 more
openaire   +2 more sources

Monotone finite volume schemes for diffusion equations on polygonal meshes

Journal of Computational Physics, 2008
We construct a nonlinear finite volume (FV) scheme for diffusion equation on star-shaped polygonal meshes and prove that the scheme is monotone, i.e., it preserves positivity of analytical solutions for strongly anisotropic and heterogeneous full tensor coefficients.
Guangwei Yuan, Zhiqiang Sheng
openaire   +2 more sources

A Note on Monotone Polygons Fitted to Bivariate Data

Psychometrika, 1976
The monotone regression function of Kruskal and the rank image function of Guttman and Lingoes were fitted to bivariate normal samples and their statistical properties contrasted.
openaire   +2 more sources

A new linear algorithm for triangulating monotone polygons

Pattern Recognition Letters, 1984
Let P = (p"1, p"2,...,p"n) be a monotone polygon whose vertices are specified in terms of cartesian coordinates in order. A new simple two-step procedure is presented for triangulating P, without the addition of new vertices, in O(n) time. Unlike the previous algorithm no specialized code is needed since the new approach uses well-known existing ...
openaire   +2 more sources

Monotonic Polygons and Paths in Weighted Point Sets

2011
Let P be a set of n points such that each of its elements has a unique weight in {1, …,n}. P is called a wp-set. A non-crossing polygonal line connecting some elements of P in increasing (or decreasing) order of their weights is called a monotonic path of P. A simple polygon with vertices in P is called monotonic if it is formed by a monotonic path and
Toshinori Sakai, Jorge Urrutia
openaire   +2 more sources