Discrete and computational geometry : [second] Japanese conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, revised papers
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 among...
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
1763 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Discrete and computational geometry, second Japanese conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, revised papers, Jin Akiyama, Mikio Kano, Masatsugu Urabe (eds.), 2000, New York, Springer, 1 vol. (VIII-331 p.), Lecture notes in computer science, 3-540-67181-1 • Discrete and Computational Geometry, Texte imprimé, 9783662179277 |
Aurkibidea:
- 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.