Discrete and Computational Geometry Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Akiyama, Jin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Kano, Mikio (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Urabe, Masatsugu (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1763
• Θέματα: Geometry.; Computers.; Computer graphics.; Algorithms.; Computer science-Mathematics.; Combinatorics.; Theory of Computation.; Computer Graphics.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.

This volume consists of those papers presented at the Japan Conference on Discrete and Computational Geometry '98. The conference was held 9-12 - cember 1998 at Tokai University in Tokyo. Close to a hundred participants from 10 countries participated. Interest in Computational Geometry surfaced...

Πίνακας περιεχομένων:

• Papers
• Radial Perfect Partitions of Convex Sets in the Plane
• Dudeney Dissection of Polygons
• Effective Use of Geometric Properties for Clustering
• Living with lrs
• On the Existente of a Point Subset with 4 or 5 Interior Points
• Planar Drawing Algorithms of Survivable Telecommunication Networks
• Polygon Cutting: Revisited
• Algorithms for Packing Two Circles in a Convex Polygon
• Folding and Cutting Paper
• An Interpolant Based on Line Segment Voronoi Diagrams
• 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
• NP-Completeness of Stage Illumination Problems
• On the Maximum Degree of Bipartite Embeddings of Trees in the Plane
• Efficient Regular Polygon Dissections
• On Soddy's Hexlet and a Linked 4-Pair
• Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs
• Visibility of Disks on the Lattice Points
• Convex Hull Problem with Imprecise Input
• One-Dimensional Tilings with Congruent Copies of a 3-Point Set
• Polygonal Approximations for Curved Problems: An Application to Arrangements
• Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms
• Folding and Unfolding in Computational Geometry
• Crossing Numbers
• A Note on the Existente of Plane Spanning Trees of Geometrie Graphs
• Embeddings of Equilateral Polygons in Unit Lattices
• Order-k Voronoi Diagrams, k-Sections, and k-Sets
• "Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion -
• An Efficient Solution to the Corridor Search Problem.