Vai al contenuto principale della pagina

Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 / / edited by Jin Akiyama, Mikio Kano, Xuehou Tan



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 / / edited by Jin Akiyama, Mikio Kano, Xuehou Tan Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Edizione: 1st ed. 2005.
Descrizione fisica: 1 online resource (VIII, 213 p.)
Disciplina: 006.6
Soggetto topico: Computer graphics
Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Convex geometry
Discrete geometry
Computer Graphics
Discrete Mathematics in Computer Science
Data Science
Convex and Discrete Geometry
Persona (resp. second.): AkiyamaJin
KanoMikio
TanXuehou
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 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.
Titolo autorizzato: Discrete and computational geometry  Visualizza cluster
ISBN: 3-540-32089-X
3-540-30467-3
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996465731403316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 3742