E Book

Discrete and Computational Geometry

---

Matching Points with Circles and Squares -- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation -- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs -- Sliding Disks in the Plane -- Weighted Ham-Sandwich Cuts -- Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane -- Farthest-Point Queries with Geometric and Combinatorial Constraints -- Grid Vertex-Unfolding Orthostacks -- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem -- Tight Time Bounds for the Minimum Local Convex Partition Problem -- I/O-Efficiently Pruning Dense Spanners -- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons -- Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon -- Wedges in Euclidean Arrangements -- Visual Pascal Configuration and Quartic Surface -- Nonexistence of 2-Reptile Simplices -- Single-Vertex Origami and Spherical Expansive Motions -- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms -- Crossing Stars in Topological Graphs -- The Geometry of Musical Rhythm.

---

Ketersediaan

Tidak ada salinan data

Informasi Detail

Judul Seri

-

No. Panggil

-

Penerbit

Berlin, Heidelberg : Springer., 2005

Deskripsi Fisik

VIII, 213 p.online resource.

Bahasa

English

ISBN/ISSN

9783540320890

Klasifikasi

006.6

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

1st ed.

Subjek

Algorithms.
Algorithm Analysis and Problem Complexity.
Computer graphics.
Data structures (Computer science).
Computer science—Mathematics.
Discrete Mathematics in Computer Science.
Data Structures.
Convex geometry .
Discrete geometry.
Convex and Discrete Geometry.

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Jin Akiyama, Mikio Kano, Xuehou Tan.

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar