E Book Teknik dan Informatika

Lecture Notes in Computer Science

---

Many problems in computational geometry are not stated in graphtheoretic
terms, but can be solved efficiently by constructing an auxiliary graph
and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm
depends on the special properties of the graph constructed in this way.We
survey the art gallery problem, partition into rectangles, minimum-diameter clustering,
rectilinear cartogram construction, mesh stripification, angle optimization
in tilings, and metric embedding from this perspective.

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

EB1.35

Penerbit

Jakarta : Springer Science+Business Media., 2010

Deskripsi Fisik

-

Bahasa

English

ISBN/ISSN

978-3-642-11408-3

Klasifikasi

EB1.35

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

-

Info Detail Spesifik

-

Pernyataan Tanggungjawab

-

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar