29 search results - page 2 / 6 » Encompassing colored planar straight line graphs |
SODA
2000
ACM
13 years 6 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
CCCG
2007
13 years 6 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
CCCG
2003
13 years 6 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
CDC
2008
IEEE
13 years 7 months ago
2008
IEEE
This paper gives an overview of guidance laws that can be applied for planar motion control purposes. Considered scenarios include target tracking, where only instantaneous informa...
IPL
2006
13 years 5 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...