Lecture Notes in Computer Science

Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers

By: Jin Akiyama (Editor), Mikio Kano (Editor), Masatsugu Urabe (Editor)

Write A Review

Paperback | 16 February 2000

At a Glance

Paperback
348 Pages

Dimensions(cm)
24.13 x 15.88 x 1.91

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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 engineers in Japan - out twenty years ago, while interest in Discrete Geometry arose as a natural extension of the research of a group of graph theorists more recently. One of the goals of the conference was to bring together these two groups and to put them in contact with experts in these ?elds from abroad. This is the second conference in the series. The plan is to hold one every year and to publish the papers of the conferences every two years. The organizers thank the sponsors of the conference, namely, The Institute of Educational Development of Tokai University, Grant-in-Aid of the Ministry of Education of Japan (A.Saito;(A)10304008), Mitsubishi Research Institute, Sanada Institute of System Development, Japan Process, and Upward. They also thank especially T. Asano, D. Avis, V. Chv´ atal, H. Imai, J. Pach, D. R- paport, M. Ruiz, J. O'Rourke, K. Sugihara, T. Tokuyama, and J. Urrutia for their interest and support.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Mathematics Groups & Group Theory Discrete Mathematics Geometry Analytic Geometry Medicine Medicine in General Computing & I.T.Graphical & Digital Media Applications Computer Science Mathematical Theory of Computation

Databases Data Capture & Analysis Computer Programming & Software Development Algorithms & Data Structures Combinatorics & Graph Theory

Papers
Radical Perfect Partitions of Convex Sets in the Plane	p. 1
Dudeney Dissection of Polygons	p. 14
Effective Use of Geometric Properties for Clustering	p. 30
Living with lrs	p. 47
On the Existence of a Point Subset with 4 or 5 Interior Points	p. 57
Planar Drawing Algorithms of Survivable Telecommunication Networks	p. 65
Polygon Cutting: Revisited	p. 81
Algorithms for Packing Two Circles in a Convex Polygon	p. 93
Folding and Cutting Paper	p. 104
An Interpolant Based on Line Segment Voronoi Diagrams	p. 119
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces	p. 129
NP-Completeness of Stage Illumination Problems	p. 158
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane	p. 166
Efficient Regular Polygon Dissections	p. 172
On Soddy's Hexlet and a Linked 4-Pair	p. 188
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs	p. 194
Visibility of Disks on the Lattice Points	p. 201
Convex Hull Problem with Imprecise Input	p. 207
One-Dimensional Tilings with Congruent Copies of a 3-Point Set	p. 220
Polygonal Approximations for Curved Problems: An Application to Arrangements	p. 235
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms	p. 250
Folding and Unfolding in Computational Geometry	p. 258
Crossing Numbers	p. 267
A Note on the Existence of Plane Spanning Trees of Geometric Graphs	p. 274
Embeddings of Equilateral Polygons in Unit Lattices	p. 278
Order-k Voronoi Diagrams, k-sections, and k-sets	p. 290
"Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion -	p. 305
An Efficient Solution to the Corridor Search Problem	p. 317
Author Index	p. 333
Table of Contents provided by Publisher. All Rights Reserved.

Lecture Notes in Computer Science

Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

Automatic Generation Of Algorithms

Advances in Metaheuristics

Federated Learning for Smart Communication using IoT Application

Chapman & Hall/CRC Cyber-Physical Systems

Lights and Shadows on Generalizations in Fixed Point Theory

Discrete Mathematics for Computing

Grassroots

Marxian Economics

A New Japanese Tradition

How to Prove It

A Structured Approach

Reading Randomness I

New Horizons for Understanding Fractal and Fractional Calculus

Weakened Ramsey Theory

Discrete Mathematics and Its Applications

Fuzzy Sets and Triangular Norms

Aggregation in Decision-Aided Intelligent Systems

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Topics in Mathematical Modeling by Difference Equations

With Mathematica

Introduction to Modern Cryptography

Revised Third Edition

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications

2025 Release ISE

Parabolic Problems

60 Years of Mathematical Puzzles in Parabola

Business Process Analytics

Modeling, Simulation and Design

Discrete Choice Models

Mathematical Methods, Econometrics, and Data Science

Axiomatic Set Theory

An Introduction

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Geometry of Frameworks

Compact Textbooks in Mathematics

Combinatorics and Combinatorial Computing

MCCCC34, Normal, IL, USA, October 21-23, 2022

Quantum Communication and Cryptography

The Algebra of Code, Volume 1

Explore Set Theory, Abstract Algebra, and Category Theory with Functional Programming

New Probes into Discrete and Convex Geometry

Bolyai Society Mathematical Studies

This product is categorised by