Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Discrete and Computational Geometry

Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Jin Akiyama

    1. Research Institute of Education, Tokai University, Shibuya-ku Tokio, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Mikio Kano

    1. Ibaraki University, Nakanarusawa, Hitachi, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Xuehou Tan

    1. Tokai University, Numazu, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3742)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: JCDCG 2004.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (20 papers)

  1. Front Matter

    Download chapter PDF

  2. Matching Points with Circles and Squares

    • Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell et al.
    Pages 1-15

  3. The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation

    • Marc Benkert, Alexander Wolff, Florian Widmann
    Pages 16-28

  4. Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs

    • Sergey Bereg
    Pages 29-36

  5. Sliding Disks in the Plane

    • Sergey Bereg, Adrian Dumitrescu, János Pach
    Pages 37-47

  6. Weighted Ham-Sandwich Cuts

    • Prosenjit Bose, Stefan Langerman
    Pages 48-53

  7. Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane

    • Hervé Brönnimann
    Pages 54-61

  8. Farthest-Point Queries with Geometric and Combinatorial Constraints

    • Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
    Pages 62-75

  9. Grid Vertex-Unfolding Orthostacks

    • Erik D. Demaine, John Iacono, Stefan Langerman
    Pages 76-82

  10. A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem

    • Magdalene Grantson, Christos Levcopoulos
    Pages 83-94

  11. Tight Time Bounds for the Minimum Local Convex Partition Problem

    • Magdalene Grantson, Christos Levcopoulos
    Pages 95-105

  12. I/O-Efficiently Pruning Dense Spanners

    • Joachim Gudmundsson, Jan Vahrenhold
    Pages 106-116

  13. On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons

    • Kiyoshi Hosono, Masatsugu Urabe
    Pages 117-122

  14. Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon

    • Hiro Ito
    Pages 123-130

  15. Wedges in Euclidean Arrangements

    • Jonathan Lenchner
    Pages 131-142

  16. Visual Pascal Configuration and Quartic Surface

    • Yoichi Maeda
    Pages 143-150

  17. Nonexistence of 2-Reptile Simplices

    • Jiří Matoušek
    Pages 151-160

  18. Single-Vertex Origami and Spherical Expansive Motions

    • Ileana Streinu, Walter Whiteley
    Pages 161-173

  19. An Optimal Algorithm for the 1-Searchability of Polygonal Rooms

    • Xuehou Tan
    Pages 174-183

  20. Crossing Stars in Topological Graphs

    • Gábor Tardos, Géza Tóth
    Pages 184-197
Back to top

Editors and Affiliations

  • Research Institute of Education, Tokai University, Shibuya-ku Tokio, Japan

    Jin Akiyama

  • Ibaraki University, Nakanarusawa, Hitachi, Japan

    Mikio Kano

  • Tokai University, Numazu, Japan

    Xuehou Tan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation