default search action
2. JCDCG 1998: Tokyo, Japan
- Jin Akiyama, Mikio Kano, Masatsugu Urabe:
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 - 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 - Jin Akiyama, Gisaku Nakamura:
Dudeney Dissection of Polygons. 14-29 - Tetsuo Asano:
Effective Use of Geometric Properties for Clustering. 30-46 - David Avis:
Living with lrs. 47-56 - David Avis, Kiyoshi Hosono, Masatsugu Urabe:
On the Existence of a Point Subset with 4 or 5 Interior Points. 57-64 - Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia:
Planar Drawing Algorithms of Survivable Telecommunication Networks. 65-80 - Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari:
Polygon Cutting: Revisited. 81-92 - Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari:
Algorithms for Packing Two Circles in a Convex Polygon. 93-103 - Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Folding and Cutting Paper. 104-118 - Hisamoto Hiyoshi, Kokichi Sugihara:
An Interpolant Based on Line Segment Voronoi Diagrams. 119-128 - Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. 129-157 - Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
NP-Completeness of Stage Illumination Problems. 158-165 - Atsushi Kaneko:
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. 166-171 - Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Efficient Regular Polygon Dissections. 172-187 - Hiroshi Maehara, Ai Oshiro:
On Soddy's Hexlet and a Linked 4-Pair. 188-193 - Tomomi Matsui:
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. 194-200 - Nobuaki Mutoh, Gisaku Nakamura:
Visibility of Disks on the Lattice Points. 201-206 - Takayuki Nagai, Seigo Yasutome, Nobuki Tokura:
Convex Hull Problem with Imprecise Input. 207-219 - Tomoki Nakamigawa:
One-Dimensional Tilings with Congruent Copies of a 3-Point Set. 220-234 - Manuela Neagu:
Polygonal Approximations for Curved Problems: An Application to Arrangements. 235-249 - Frank Nielsen
:
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms. 250-257 - Joseph O'Rourke:
Folding and Unfolding in Computational Geometry. 258-266 - János Pach:
Crossing Numbers. 267-273 - Eduardo Rivera-Campo:
A Note on the Existence of Plane Spanning Trees of Geometric Graphs. 274-277 - Toshinori Sakai:
Embeddings of Equilateral Polygons in Unit Lattices. 278-289 - Dominique Schmitt, Jean-Claude Spehner:
Order-k Voronoi Diagrams, k-Sections, and k-Sets. 290-304 - Kokichi Sugihara:
"Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion. 305-316 - Xuehou Tan:
An Efficient Solution to the Corridor Search Problem. 317-331
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-13 21:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: