Sökning: "geometric spanners"
Hittade 2 avhandlingar innehållade orden geometric spanners.
1. Geometric Decompositions and Networks - Approximation Bounds and Algorithms
Sammanfattning : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. LÄS MER
2. Approximation Algorithms for Geometric Networks
Sammanfattning : The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. LÄS MER
Resultatsidor:
1