Discrete and computational geometry : Japanese conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, revised selected papers / Jin Akiyama, Mikio Kano, Xuehou Tan (eds.).

By: JCDCG (Conference) (2004 : Tokyo, Japan)
Contributor(s): Akiyama, J | Kanō, Mikio, 1949- | Tan, Xuehou
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 3742.Publisher: Berlin ; New York : Springer, ©2005Description: 1 online resource (viii, 212 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540320890; 354032089X; 3540304673; 9783540304678Subject(s): Combinatorial geometry -- Congresses | Geometry -- Data processing -- Congresses | Géométrie -- Informatique -- Congrès | Géométrie combinatoire -- Congrès | MATHEMATICS -- Geometry -- General | Informatique | Combinatorial geometry | Geometry -- Data processing | Algorithmische Geometrie | Diskrete Geometrie | algoritmen | algorithms | computeranalyse | computer analysis | computergrafie | computer graphics | meetkunde | geometry | wiskunde | mathematics | computerwetenschappen | computer sciences | gegevensstructuren | data structures | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. | Kongress. | Tokio (2004) Additional physical formats: Print version:: Discrete and computational geometry.DDC classification: 516/.11 LOC classification: QA167 | .J33 2004ebOnline resources: Click here to access online
Contents:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

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.

There are no comments for this item.

to post a comment.

Powered by Koha