Shankar P Sastry
Shankar P Sastry
I present a generalization of Chew's first algorithm for Delaunay mesh refinement. I split the line segments of an input planar straight line graph (PSLG) such that the lengths of split segments are asymptotically proportional to the local ...
Therese Biedl,Martin Held,Stefan Huber et al.
Therese Biedl et al.
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 ambiguity issues in the procedural definition. We investigate the ge...
Xiaodong Wu,Xin Dou,John E Bayouth et al.
Xiaodong Wu et al.
In this paper, we study an interesting geometric partition problem, called optimal field splitting, which arises in Intensity-Modulated Radiation Therapy (IMRT). In current clinical practice, a multi-leaf collimator (MLC) with a maximum lea...
Oswin Aichholzer,Tillmann Miltzow,Alexander Pilz
Oswin Aichholzer
Many properties of finite point sets only depend on the relative position of the points, e.g., on the order type of the set. However, many fundamental algorithms in computational geometry rely on coordinate representations. This includes th...
Oswin Aichholzer,Ruy Fabila-Monroy,Thomas Hackl et al.
Oswin Aichholzer et al.
Given a set B of n black points in general position, we say that a set of white points W blocks B if in the Delaunay triangulation of [Formula: see text] there is no edge connecting two black points. We give the following bounds for the siz...
Oswin Aichholzer,Günter Rote,André Schulz et al.
Oswin Aichholzer et al.
We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater than π. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct suc...
Jie Gao,Leonidas J Guibas,An Nguyen
Jie Gao
For a set S of points in ℝ(d), an s-spanner is a subgraph of the complete graph with node set S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidean distance between the...
A package for exact kinetic data structures and sweepline algorithms [0.03%]
一个用于精确动力学数据结构和扫描线算法的软件包
Daniel Russel,Menelaos I Karavelas,Leonidas J Guibas
Daniel Russel
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was influenced by various considerations, including extensibility...