Results 61 to 70 of about 4,255,094 (265)
Severini and Mansour introduced $\textit{square polygons}$, as graphical representations of $\textit{square permutations}$, that is, permutations such that all entries are records (left or right, minimum or maximum), and they obtained a nice formula for ...
Enrica Duchi, Dominique Poulalhon
doaj +1 more source
GMZ: A GML COMPRESSION MODEL FOR WEBGIS [PDF]
Geography markup language (GML) is an XML specification for expressing geographical features. Defined by Open Geospatial Consortium (OGC), it is widely used for storage and transmission of maps over the Internet.
A. Khandelwal, K. S. Rajan
doaj +1 more source
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes [PDF]
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon.
Demaine, Erik D.+3 more
core +3 more sources
AREAL FEATURE MATCHING BASED ON SIMILARITY USING CRITIC METHOD [PDF]
In this paper, we propose an areal feature matching method that can be applied for many-to-many matching, which involves matching a simple entity with an aggregate of several polygons or two aggregates of several polygons with fewer user intervention. To
J. Kim, K. Yu
doaj +1 more source
Visibility of a simple polygon
Abstract The hidden line problem in the plane is studied and an optimal algorithm for finding the visibility polygon of a point inside or outside a simple polygon is given. The algorithm uses only one stack, instead of three as used in a previously known algorithm by El-Gindy and Avis (J. Algor. 2, 1981, 186–197).
openaire +2 more sources
Meteo Browser South Tyrol: A Shiny App to download the meteorological time series from the Open Data Catalogue of the Province of Bolzano/Bozen - Italy [PDF]
Meteo Browser South Tyrol is a user-friendly web-based application that helps to visualize and download the hydro-meteorological time series freely available in South Tyrol, Italy.
Giulio Genova+3 more
doaj +3 more sources
Covering a Simple Polygon by Monotone Directions
AbstractIn this paper we study the problem of finding a set of k directions for a given simple polygon P, such that for each point p∈P there is at least one direction in which the line through p intersects the polygon only once. For k=1, this is the classical problem of finding directions in which the polygon is monotone, and all such directions can be
Ahn, HK+4 more
openaire +5 more sources
A simple proof for visibility paths in simple polygons
The purpose of this note is to give a simple proof for a necessary and sufficient condition for visibility paths in simple polygons. A visibility path is a curve such that every point inside a simple polygon is visible from at least one point on the path.
Charkari, Nasrollah Moghaddam+1 more
core
An Algorithm for Finding Convex Hulls of Planar Point Sets
This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group ofquadrilaterals (e-
Mei, Gang+2 more
core +1 more source
Polygons can conveniently represent real world objects. In automatic character recognition, shapes of individual letters are represented by polygons. In robotics, obstacles are represented using polygons.
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source