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 …

This paper deals with the fast computation of straight skeletons of planar straight-line graphs
(PSLGs) at an industrial-strength level. We discuss both the theoretical foundations of our …

We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin
graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base …

A straight skeleton is a well-known geometric structure, and several algorithms exist to
construct the straight skeleton for a given polygon or planar straight-line graph. In this paper …

This paper describes the implementation of an hierarchical key management system to
provide secure multicast communications in mobile network environments. By using this …

We investigate the graphs formed from the vertices and creases of an origami pattern that
can be folded flat along all of its creases. As we show, this is possible for a tree if and only if …

The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices
during a mitered offsetting process. It is known that the straight skeleton of a simple polygon …

A weighted bisector graph is a geometric graph whose faces are bounded by edges that are
portions of multiplicatively weighted bisectors of pairs of (point) sites such that each of its …

The farthest-point Voronoi diagram of a set of n sites is a tree with n leaves. We investigate
whether arbitrary trees can be realized as farthest-point Voronoi diagrams. Given an abstract …

Given a rectilinear polygon P and a point p ∈ P p∈ P, what is a largest axis-parallel square
in P that contains p? This question arises in VLSI design from physical limitations of …