Indoor navigation networks are the foundation of indoor localization-based services. To
build navigation graph networks of buildings, the medial axis is an effective way to represent …

Delimiting the service area of public facilities is an essential topic in spatial analysis studies.
The adaptive crystal growth Voronoi diagrams based on weighted planes are one of the …

We present a new algorithm to compute motorcycle graphs. It runs in O(nn\logn) time when n
is the number of motorcycles. We give a new characterization of the straight skeleton of a …

Abstract Voronoi diagrams [R. Klein, Concrete and Abstract Voronoi Diagrams, Lecture
Notes in Computer Science, vol. 400, Springer-Verlag, 1987] were designed as a unifying …

We investigate weighted straight skeletons from a geometric, graph-theoretical, and
combinatorial point of view. We start with a thorough definition and shed light on some …

Abstract Network Voronoi diagrams (N-VDs) are effective geometric constructions for
partitioning geographical space constrained by road networks. However, they are not …

The weighted ℓp or ℓk, p norm is used to model travel distances in road networks. The
parameters k and p are computed from a sample of actual road distances taken from the …

Most existing methods for service area delimitation are sensitive to the modifiable areal unit
problem (MAUP) since the census data used to account for the socioeconomic context are …

We propose algorithms for a special type of geometric facility location problem in which
customers may choose not to use the facility. We minimize the maximum cost incurred to a …

Abstract Abstract Voronoi diagrams (AVDs) are based on bisecting curves enjoying simple
combinatorial properties, rather than on the geometric notions of sites and circles. They …