Canadian Conference on Computational Geometry Cccg '96

, by Fiala, Frank; Kranakis, Evangelos; Sack, Jorg-Rudiger

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

ISBN: 9780886293079 | 0886293073
Cover: Paperback
Copyright: 12/1/1996

eBook

Available Instantly

Online: 1825 Days

Downloadable: Lifetime Access

*To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.

$66.00*

The 8th Canadian conference on computational geometry had an international flavour. Sixty-one papers were submitted by authors from over 20 countries representing four continents. The conference was held at Carleton University in August 1996.

Preface

Monday, August 12

(98)

Session M1 Invited Lecture by Roberto Tamassia Robust proximity queries in implicit Voronoi diagrams

(1)

R. Tamassia

G. Liotta

F. P. Preparata

Session M2 O-Convexity: Computing hulls, approximations, and orientation sets

(6)

V. Martynchik

N. Metelski

D. Wood

Efficient algorithms for counting and reporting pairwise intersections between convex polygons

(6)

P. Gupta

R. Janardan

M.l Smid

Convex hulls of bounded curvature

(6)

J.-D. Boissonnat

S. Lazard

Enclosing k points in the smallest axis parallel rectangle

(6)

M. Segal

K. Kedem

Session M3 Finding the set of all minimal nested convex polygons

(6)

J. Bhadury

R. Chandrasekaran

Optimizing a corridor between two polygons with an application to polyhedral interpolation

(6)

G. Barequet

B. Wolfers

Heuristics for the generation of random polygons

(6)

T. Auer

M. Held

Orthogonal polygon reconstruction

(6)

L. Jackson

S.K. Wismath

Session M4 Correcting topological defects of tessellations

(6)

D. Wang

J. A. Goldak

Generating rooted triangulations with minimum degree four

(6)

D. Avis

C. M. Kong

On stable line segments in triangulations

(6)

A. Mirzaian

C. A. Wang

Y.-F. Xu

Diamonds are not a minimum weight triangulation's best friend

(6)

P. Bose

L. Devroye

W. Evans

Session M5 Stabbing information of a simple polygon

(6)

H. Everett

F. Hurtado

M. Noy

K-transversals of parallel convex sets

(7)

N. Amenta

Fast stabbing of boxes in high dimensions

(6)

F. Nielsen

Shooter location problem

(6)

S. C. Nandy

K. Mukhopadhyaya

Bhargab B. Bhattacharya

Tuesday, August 13

(91)

Session Tu1 Invited Lecture by C. Bajaj Computational geometry for interrogative visualization

(2)

C. Bajaj

Session Tu2 An optimal algorithm for dynamic post-office problem in R12 and related problems

101

(6)

S. N. Bespamyatnikh

A topology oriented algorithm for the Voronoi diagram of polygons

107

(6)

T. Imai

On non-smooth convex distance functions

113

(6)

N.-M. Le

Time-optimal proximity graph computations on enhanced meshes

119

(6)

S. Olariu

I. Stojmenovic

A. Y. Zomaya

Session Tu3 Deforming curves in the plane for tethered-robot motion planning

125

(6)

S. Hert

V. Lumelsky

Heuristic motion planning with movable obstacles

131

(6)

T. Chadzelek

J. Eckstein

E. Schomer

Viewing a set of spheres while moving on a linear flightpath

137

(6)

F. Follert

Approximating shortest paths in arrangments of lines

143

(6)

P. Bose

W. Evans

D. Kirkpatrick

M. McAllister

J. Snoeyink

Session Tu4 Velocity planning for a robot moving along the shortest straight line path among moving obstacles

149

(6)

K. Krithivasan

A. Rema

S. Schirra

P.I. Vijaykumar

Lower bounds for computing geometric spanners and approximate shortest paths

155

(6)

D. Z. Chen

G. Das

M. Smid

On the reachable regions of chains

161

(6)

N. Pei

S. Whitesides

Heuristic motion planning with many degrees of freedom

167

(6)

T. Chadzelek

J. Eckstein

E. Schomer

Session Tu5 Computing largest circles separating two sets of segments

173

(6)

J.-D. Boissonnat

J. Czyzowicz

O. Devillers

J. Urrutia

M. Yvinec

On the permutations generated by rotational sweeps of planar point sets

179

(6)

H. Bieri

P.-M. Schmidt

Maximal length common non-intersecting paths

185

(5)

J. Czyzowicz

E. Kranakis

D. Krizanc

J. Urrutia

Wednesday, August 14

190

(86)

Session W1 Maintaining multiple levels of detail in the overlay of hierarchical subdivisions

190

(6)

P. Magillo

L. Floriani

Distance-based subdivision for translational LP containment

196

(6)

K. Daniels

V. J. Milenkovic

Variable resolution terrain surfaces

202

(9)

E. Puppo

Session W2 Generalizing halfspaces

211

(6)

E. Fink

D. Wood

Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain

217

(6)

P. Bose

D. Kirkpatrick

Z. Li

The surveillance of the walls of an art gallery

223

(11)

A. Laurentini

Session W3 On rectangle visibility graphs. III. External visibility and complexity

234

(6)

T. C. Shermer

Maintaining visibility of a polygon with a moving point of view

240

(6)

D. Z. Chen

O. Daescu

Visibility graph of a set of line sements: A dynamic sequential algorithm and its parallel version

246

(6)

A. Atassi

Dynamic algorithms for approximate neighbor searching

252

(6)

S. N. Bespamyatnikh

Session W4 Three-dimensional restricted-orientation convexity

258

(6)

E. Fink

D. Wood

Efficient algorithms for the smallest enclosing cylinder problem

264

(6)

E. Schomer

J. Sellen

M. Teichmann

C. Yap

On the (n4/3) weak lower bounds for some 3D geometric problems

270

(6)

B. Zhu

Thursday, August 15

276

(67)

Session Th1 Invited Lecture by P. Raghavan

Computational geometry impact potential: A business and industrial perspective

276

(1)

P. Raghavan

Session Th2 Probalistic algorithms for efficient grasping and fixturing

277

(6)

M. Teichmann

On a problem of immobilizing polygons

283

(6)

J. Czyzowicz

I. Stojmenovic

T. Szymacha

Finding an o(n2log n) algorithm is sometimes hard

289

(6)

A. Hernandez Barrera

Improved orthogonal drawings of 3-graphs

295

(5)

T. Biedl

Session Th3 Algorithms on polygonal embeddings of graphs

300

(6)

L. Cai

Optimal orthogonal drawings of connected plane graphs

306

(6)

T. Biedl

Straight line embeddings of planar graphs on point sets

312

(7)

N. Castaneda

J. Urrutia

Extending rectangular range reporting with query sensitive analysis

319

(6)

R. Y. Flatland

C. V. Stewart

Session Th4 The complexity of rivers in triangulated terrains

325

(6)

M. de Berg

P. Bose

K. Dobrint

M. van Kreveld

M. Overmars

M. de Groot

T. Roos

J. Snoeyink

S. Yu

Computing the angularity tolerance

331

(6)

M. de Berg

H. Meijer

M. Overmars

G. Wilfong

The complexity of illuminating polygons by -flood-lights

337

(6)

J. Bagga

L. Gewali

D. Glasser

Author Index

343

Please wait while the item is added to your bag...

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Canadian Conference on Computational Geometry Cccg '96

Summary

Table of Contents

Supplemental Materials

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Canadian Conference on Computational Geometry Cccg '96

Summary

Table of Contents

Supplemental Materials

Digital License