Results 191 to 200 of about 148,856 (241)
Some of the next articles are maybe not open access.
GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
International Journal of Computational Geometry & Applications, 2005A 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
A Note on Monotone Polygons Fitted to Bivariate Data
Psychometrika, 1976The 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 +3 more sources
A new linear algorithm for triangulating monotone polygons
Pattern Recognition Letters, 1984Summary: 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.
openaire +2 more sources
Monotone finite volume schemes for diffusion equations on polygonal meshes
Journal of Computational Physics, 2008We 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
Monotonic Polygons and Paths in Weighted Point Sets
2011Let 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
Testing a simple polygon for monotonicity
Information Processing Letters, 1981Franco P. Preparata, Kenneth J. Supowit
openaire +2 more sources
Parallel triangulation of a polygon in two calls to the trapezoidal map
Algorithmica, 2018C. Yap
semanticscholar +1 more source
Monotone coloring of 3D MR image slices and extraction of their superficial and volumetric features
International Conference on Next Generation Computing Technologies, 2016A. A. Kumar, E. Rajan
semanticscholar +1 more source