Sciweavers

450 search results - page 42 / 90
» Quadrangulations of Planar Sets
Sort
View
AUTOMATICA
2010
119views more  AUTOMATICA 2010»
13 years 9 months ago
Path following for the PVTOL aircraft
This article presents a solution to the path following problem for the planar vertical take-off and landing aircraft (PVTOL) which is applicable to a class of smooth Jordan curves...
Luca Consolini, Manfredi Maggiore, Christopher Nie...
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 8 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
13 years 11 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
CCCG
2008
13 years 10 months ago
Data Structures for Restricted Triangular Range Searching
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear...
Mashhood Ishaque, Diane L. Souvaine, Nadia Benbern...
CCCG
2003
13 years 10 months ago
Decomposing Polygons Into Diameter Bounded Components
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
Chris Worman