66 research outputs found
Essential Constraints of Edge-Constrained Proximity Graphs
Given a plane forest of points, we find the minimum
set of edges such that the edge-constrained minimum spanning
tree over the set of vertices and the set of constraints contains .
We present an -time algorithm that solves this problem. We
generalize this to other proximity graphs in the constraint setting, such as
the relative neighbourhood graph, Gabriel graph, -skeleton and Delaunay
triangulation. We present an algorithm that identifies the minimum set
of edges of a given plane graph such that for , where is the
constraint -skeleton over the set of vertices and the set of
constraints. The running time of our algorithm is , provided that the
constrained Delaunay triangulation of is given.Comment: 24 pages, 22 figures. A preliminary version of this paper appeared in
the Proceedings of 27th International Workshop, IWOCA 2016, Helsinki,
Finland. It was published by Springer in the Lecture Notes in Computer
Science (LNCS) serie
Ear-clipping Based Algorithms of Generating High-quality Polygon Triangulation
A basic and an improved ear clipping based algorithm for triangulating simple
polygons and polygons with holes are presented. In the basic version, the ear
with smallest interior angle is always selected to be cut in order to create
fewer sliver triangles. To reduce sliver triangles in further, a bound of angle
is set to determine whether a newly formed triangle has sharp angles, and edge
swapping is accepted when the triangle is sharp. To apply the two algorithms on
polygons with holes, "Bridge" edges are created to transform a polygon with
holes to a degenerate polygon which can be triangulated by the two algorithms.
Applications show that the basic algorithm can avoid creating sliver triangles
and obtain better triangulations than the traditional ear clipping algorithm,
and the improved algorithm can in further reduce sliver triangles effectively.
Both of the algorithms run in O(n2) time and O(n) space.Comment: Proceedings of the 2012 International Conference on Information
Technology and Software Engineering Lecture Notes in Electrical Engineering
Volume 212, 2013, pp 979-98
Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood Graphs
We demonstrate that a graph-based search algorithm-relying on the
construction of an approximate neighborhood graph-can directly work with
challenging non-metric and/or non-symmetric distances without resorting to
metric-space mapping and/or distance symmetrization, which, in turn, lead to
substantial performance degradation. Although the straightforward metrization
and symmetrization is usually ineffective, we find that constructing an index
using a modified, e.g., symmetrized, distance can improve performance. This
observation paves a way to a new line of research of designing index-specific
graph-construction distance functions
Approximating Mexican highways with slime mould
Plasmodium of Physarum polycephalum is a single cell visible by unaided eye.
During its foraging behavior the cell spans spatially distributed sources of
nutrients with a protoplasmic network. Geometrical structure of the
protoplasmic networks allows the plasmodium to optimize transport of nutrients
between remote parts of its body. Assuming major Mexican cities are sources of
nutrients how much structure of Physarum protoplasmic network correspond to
structure of Mexican Federal highway network? To find an answer undertook a
series of laboratory experiments with living Physarum polycephalum. We
represent geographical locations of major cities by oat flakes, place a piece
of plasmodium in Mexico city area, record the plasmodium's foraging behavior
and extract topology of nutrient transport networks. Results of our experiments
show that the protoplasmic network formed by Physarum is isomorphic, subject to
limitations imposed, to a network of principle highways. Ideas and results of
the paper may contribute towards future developments in bio-inspired road
planning
Co-evolution of density and topology in a simple model of city formation
We study the influence that population density and the road network have on
each others' growth and evolution. We use a simple model of formation and
evolution of city roads which reproduces the most important empirical features
of street networks in cities. Within this framework, we explicitely introduce
the topology of the road network and analyze how it evolves and interact with
the evolution of population density. We show that accessibility issues -pushing
individuals to get closer to high centrality nodes- lead to high density
regions and the appearance of densely populated centers. In particular, this
model reproduces the empirical fact that the density profile decreases
exponentially from a core district. In this simplified model, the size of the
core district depends on the relative importance of transportation and rent
costs.Comment: 13 pages, 13 figure
New variants of Perfect Non-crossing Matchings
Given a set of points in the plane, we are interested in matching them with
straight line segments. We focus on perfect (all points are matched)
non-crossing (no two edges intersect) matchings. Apart from the well known
MinMax variation, where the length of the longest edge is minimized, we extend
work by looking into different optimization variants such as MaxMin, MinMin,
and MaxMax. We consider both the monochromatic and bichromatic versions of
these problems and by employing diverse techniques we provide efficient
algorithms for various input point configurations
Analysis of road network pattern considering population distribution and central business district.
This paper proposes a road network growing model with the consideration of population distribution and central business district (CBD) attraction. In the model, the relative neighborhood graph (RNG) is introduced as the connection mechanism to capture the haracteristics of road network topology. The simulation experiment is set up to illustrate the effects of population distribution and CBD attraction on the characteristics of road network. Moreover, several topological attributes of road network is evaluated by using coverage, circuitness, treeness and total length in the experiment. Finally, the suggested model is verified in the simulation of China and Beijing Highway networks
Computational morphology: a computational geometric approach to the analysis of form
Computational Geometry is a new discipline of computer science that deals with the design and analysis of algorithms for solving geometric problems. There are many areas of study in different disciplines which, while being of a geometric nature, have as their main component the extraction of a description of the shape or form of the input data. This notion is more imprecise and subjective than pure geometry. Such fields include cluster analysis in statistics, computer vision and pattern recognition, and the measurement of form and form-change in such areas as stereology and developmental biol
- …