Path planning for walking characters in complicated virtual environments is a fundamental
task in simulations and games. A navigation mesh is a data structure that allows efficient …

Abstract Voronoi diagrams are a general framework covering many types of concrete
diagrams for different types of sites or distance measures. Generalizing a famous result by …

Updating an abstract Voronoi diagram after deletion of one site in linear time has been a
well-known open problem; similarly, for concrete Voronoi diagrams of non-point sites. In this …

Given a set of n sites in the plane, their order-k Voronoi diagram partitions the plane into
regions such that all points within one region have the same k nearest sites. The order-k …

Distributed Active Sensing Networks (DASNs) is a new sensing paradigm, where active and
passive sensors are distributed in a field, and collaboratively detect the objects. The …

Path planning for walking characters in complicated virtual environments is a fundamental
task in simulations and games. In this paper, we present an improved definition of the …

We present a generalization of a combinatorial result by Aggarwal et al.(1989) on a linear-
time algorithm that selects a constant fraction of leaves, with pairwise disjoint …

Computational Geometry is the field of Computer Science that studies algorithmic problems
which can be expressed in terms of Geometry. A geometric structure that has attracted the …

Computational Geometry is a subfield of Algorithm Design and Analysis with a focus on the
design and analysis of algorithms related to discrete geometric objects. The Voronoi …

We present a generalization of a combinatorial result from Aggarwal, Guibas, Saxe and Shor
[1] on selecting a fraction of leaves, with pairwise disjoint neighborhoods, in a tree …