TY  - BOOK
AU  - Akiyama,J.
AU  - Kanō,Mikio
AU  - Urabe,Masatsugu
ED  - JCDCG '98
TI  - Discrete and computational geometry: Japanese conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, revised papers 
T2  - Lecture notes in computer science,
SN  - 9783540465157
AV  - QA167 .J33 1998
U1  - 516/.13 21
PY  - 2000///
CY  - Berlin, New York
PB  - Springer
KW  - Combinatorial geometry
KW  - Congresses
KW  - Geometry
KW  - Data processing
KW  - Computer graphics
KW  - Géométrie combinatoire
KW  - Congrès
KW  - Géométrie
KW  - Informatique
KW  - Ordinateurs
KW  - Infographie
KW  - Algorithmes
KW  - geometry
KW  - aat
KW  - computers
KW  - computer graphics
KW  - algorithms
KW  - fast
KW  - proceedings (reports)
KW  - Conference papers and proceedings
KW  - lcgft
KW  - Actes de congrès
KW  - rvmgf
N1  - Includes bibliographical references and index; 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
N2  - This book constitutes the thoroughly refereed post-conference proceedings of the Second Japanese Conference on Discrete and Computational Geometry, JCDCG8, held in Tokyo, Japan, in December 1999. The 27 revised full papers presented were carefully reviewed and selected for inclusion in the post-conference proceedings. Among the topics addressed are approximation, convex hulls, lattice computations, tilings, graph computations, Voronoi diagrams, clustering, graph drawing, diagram design, and illumination problems
UR  - https://link.springer.com/10.1007/b75044
ER  -