2. JCDCG 1998:
Tokyo,
Japan
Jin Akiyama, Mikio Kano, Masatsugu Urabe (Eds.):
Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers.
Lecture Notes in Computer Science 1763 Springer 2000, ISBN 3-540-67181-1 BibTeX
@proceedings{DBLP:conf/jcdcg/1998,
editor = {Jin Akiyama and
Mikio Kano and
Masatsugu Urabe},
title = {Discrete and Computational Geometry, Japanese Conference, JCDCG'98,
Tokyo, Japan, December 9-12, 1998, Revised Papers},
booktitle = {JCDCG},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1763},
year = {2000},
isbn = {3-540-67181-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia:
Radial Perfect Partitions of Convex Sets in the Plane.
1-13 BibTeX
- Jin Akiyama, Gisaku Nakamura:
Dudeney Dissection of Polygons.
14-29 BibTeX
- Tetsuo Asano:
Effective Use of Geometric Properties for Clustering.
30-46 BibTeX
- David Avis:
Living with lrs.
47-56 BibTeX
- David Avis, Kiyoshi Hosono, Masatsugu Urabe:
On the Existence of a Point Subset with 4 or 5 Interior Points.
57-64 BibTeX
- Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia:
Planar Drawing Algorithms of Survivable Telecommunication Networks.
65-80 BibTeX
- Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari:
Polygon Cutting: Revisited.
81-92 BibTeX
- Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari:
Algorithms for Packing Two Circles in a Convex Polygon.
93-103 BibTeX
- Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Folding and Cutting Paper.
104-118 BibTeX
- Hisamoto Hiyoshi, Kokichi Sugihara:
An Interpolant Based on Line Segment Voronoi Diagrams.
119-128 BibTeX
- Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces.
129-157 BibTeX
- Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
NP-Completeness of Stage Illumination Problems.
158-165 BibTeX
- Atsushi Kaneko:
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane.
166-171 BibTeX
- Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Efficient Regular Polygon Dissections.
172-187 BibTeX
- Hiroshi Maehara, Ai Oshiro:
On Soddy's Hexlet and a Linked 4-Pair.
188-193 BibTeX
- Tomomi Matsui:
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs.
194-200 BibTeX
- Nobuaki Mutoh, Gisaku Nakamura:
Visibility of Disks on the Lattice Points.
201-206 BibTeX
- Takayuki Nagai, Seigo Yasutome, Nobuki Tokura:
Convex Hull Problem with Imprecise Input.
207-219 BibTeX
- Tomoki Nakamigawa:
One-Dimensional Tilings with Congruent Copies of a 3-Point Set.
220-234 BibTeX
- Manuela Neagu:
Polygonal Approximations for Curved Problems: An Application to Arrangements.
235-249 BibTeX
- Frank Nielsen:
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms.
250-257 BibTeX
- Joseph O'Rourke:
Folding and Unfolding in Computational Geometry.
258-266 BibTeX
- János Pach:
Crossing Numbers.
267-273 BibTeX
- Eduardo Rivera-Campo:
A Note on the Existence of Plane Spanning Trees of Geometric Graphs.
274-277 BibTeX
- Toshinori Sakai:
Embeddings of Equilateral Polygons in Unit Lattices.
278-289 BibTeX
- Dominique Schmitt, Jean-Claude Spehner:
Order-k Voronoi Diagrams, k-Sections, and k-Sets.
290-304 BibTeX
- Kokichi Sugihara:
"Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion.
305-316 BibTeX
- Xuehou Tan:
An Efficient Solution to the Corridor Search Problem.
317-331 BibTeX
Copyright © Sat May 16 23:27:36 2009
by Michael Ley (ley@uni-trier.de)
