This list is also available as a BibTeX file.

CCCG 2005 Papers

1

Kumar Gaurav Bijay and Antoine Vigneron.
A practical approach to approximating diameter of point-set in low dimensions.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 3-6, 2005.
URL http://www.cccg.ca/proceedings/2005/1.pdf.
URL http://www.cccg.ca/proceedings/2005/1.ps.

2

James Factor.
Designing modern linkages to trace bezier curves.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 207-210, 2005.
URL http://www.cccg.ca/proceedings/2005/2.pdf.
URL http://www.cccg.ca/proceedings/2005/2.ps.

3

N. Madhusudhanan, Prosenjit Gupta, and Abhijit Mitra.
Efficient algorithms for range queries in protein sequence analysis.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 146-149, 2005.
URL http://www.cccg.ca/proceedings/2005/3.pdf.
URL http://www.cccg.ca/proceedings/2005/3.ps.

4

Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, and Birgit Vogtenhuber.
Matching edges and faces in polygonal partitions.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 126-129, 2005.
URL http://www.cccg.ca/proceedings/2005/5.pdf.
URL http://www.cccg.ca/proceedings/2005/5.ps.

5

Therese Biedl.
The complexity of domino tiling.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 187-190, 2005.
URL http://www.cccg.ca/proceedings/2005/6.pdf.
URL http://www.cccg.ca/proceedings/2005/6.ps.

6

Andre Schulz.
New results on pseudo-triangulations with low vertex degree.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 130-133, 2005.
URL http://www.cccg.ca/proceedings/2005/7.pdf.
URL http://www.cccg.ca/proceedings/2005/7.ps.

7

Jean-Daniel Boissonnat, Camille Wormser, and Mariette Yvinec.
Anisotropic diagrams: Labelle shewchuk approach revisited.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 266-269, 2005.
URL http://www.cccg.ca/proceedings/2005/8.pdf.
URL http://www.cccg.ca/proceedings/2005/8.ps.

8

Therese Biedl and Franz Brandenburg.
Drawing planar bipartite graphs with small area.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 105-108, 2005.
URL http://www.cccg.ca/proceedings/2005/11.pdf.
URL http://www.cccg.ca/proceedings/2005/11.ps.

9

Lilian BUZER.
The min-# problem, a hybrid error criterion for near linear time performance.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 23-26, 2005.
URL http://www.cccg.ca/proceedings/2005/12.pdf.
URL http://www.cccg.ca/proceedings/2005/12.ps.

10

Ovidiu Daescu, Jun Luo, and David Mount.
Proximity problems on line segments spanned by points.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 227-231, 2005.
URL http://www.cccg.ca/proceedings/2005/13.pdf.
URL http://www.cccg.ca/proceedings/2005/13.ps.

11

Theocharis Malamatos.
Lower bounds for expected-case planar point location.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 191-194, 2005.
URL http://www.cccg.ca/proceedings/2005/14.pdf.
URL http://www.cccg.ca/proceedings/2005/14.ps.

12

Therese Biedl, Anna Lubiw, and Michael Spriggs.
Morphing polyhedra preserving face normals: A counterexample.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 109-112, 2005.
URL http://www.cccg.ca/proceedings/2005/15.pdf.
URL http://www.cccg.ca/proceedings/2005/15.ps.

13

Kathryn Duffy, Chris McAloney, Henk Meijer, and David Rappaport.
Closest segments.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 232-234, 2005.
URL http://www.cccg.ca/proceedings/2005/16.pdf.
URL http://www.cccg.ca/proceedings/2005/16.ps.

14

Amr Elmasry and Khaled Elbassioni.
Output-sensitive algorithms for enumerating and counting simplices containing a given point in the plane.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 248-251, 2005.
URL http://www.cccg.ca/proceedings/2005/17.pdf.
URL http://www.cccg.ca/proceedings/2005/17.ps.

15

Eric Y. Chen and Timothy M. Chan.
Space-efficient algorithms for klee's measure problem.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 27-30, 2005.
URL http://www.cccg.ca/proceedings/2005/18.pdf.
URL http://www.cccg.ca/proceedings/2005/18.ps.

16

Pankaj Agarwal, Mark de Berg, Jie Gao, Leonidas Guibas, and Sariel Har-Peled.
Staying in the middle: Exact and approximate medians in r1 and r2 for moving points.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 43-46, 2005.
URL http://www.cccg.ca/proceedings/2005/19.pdf.
URL http://www.cccg.ca/proceedings/2005/19.ps.

17

Lilian Buzer.
Solving online feasibility problem in constant amortized time per update.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 286-289, 2005.
URL http://www.cccg.ca/proceedings/2005/20.pdf.
URL http://www.cccg.ca/proceedings/2005/20.ps.

18

Paz Carmi and Matthew Katz.
Minimum-cost load-balancing partitions.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 65-67, 2005.
URL http://www.cccg.ca/proceedings/2005/21.pdf.
URL http://www.cccg.ca/proceedings/2005/21.ps.

19

Subhashis Majumder and Bhargab B. Bhattacharya.
Density or discrepancy: A vlsi designer's dilemma in hot spot analysis.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 167-170, 2005.
URL http://www.cccg.ca/proceedings/2005/22.pdf.
URL http://www.cccg.ca/proceedings/2005/22.ps.

20

Nejib Zaguia, Guy-Vincent Jourdan, and Mustafa Alhashem.
On the pagenumber of bipartite orders.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 252-255, 2005.
URL http://www.cccg.ca/proceedings/2005/23.pdf.
URL http://www.cccg.ca/proceedings/2005/23.ps.

21

Sergio Cabello, J. Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, and Inma Ventura.
Reverse facility location problems.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 68-71, 2005.
URL http://www.cccg.ca/proceedings/2005/24.pdf.
URL http://www.cccg.ca/proceedings/2005/24.ps.

22

Maike Buchin and Joachim Giesen.
Minimizing the total absolute gaussian curvature in a terrain is hard.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 195-198, 2005.
URL http://www.cccg.ca/proceedings/2005/25.pdf.
URL http://www.cccg.ca/proceedings/2005/25.ps.

23

Kevin Buchin and Joachim Giesen.
Flow complex: General structure and algorithm.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 270-273, 2005.
URL http://www.cccg.ca/proceedings/2005/26.pdf.
URL http://www.cccg.ca/proceedings/2005/26.ps.

24

Gill Barequet and Jonathan Naor.
Large $k$-d simplices in the $d$-dimensional cube.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 31-34, 2005.
URL http://www.cccg.ca/proceedings/2005/27.pdf.
URL http://www.cccg.ca/proceedings/2005/27.ps.

25

Rabiul Islam, Nahid Afroz, Subir Bandyopadhyay, and Bhabani Sinha.
Computational geometry on optical multi-trees (omult) computer system.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 150-154, 2005.
URL http://www.cccg.ca/proceedings/2005/28.pdf.
URL http://www.cccg.ca/proceedings/2005/28.ps.

26

Stefan Schirra.
Feasibility of the exact geometric computation paradigm for largest empty anchored cylinder computation in the plane.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 171-174, 2005.
URL http://www.cccg.ca/proceedings/2005/29.pdf.
URL http://www.cccg.ca/proceedings/2005/29.ps.

27

Sándor Fekete, Michael Kaufmann, Alexander Kröller, and Katharina Lehmann.
A new approach for boundary recognition in geometric sensor networks.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 84-87, 2005.
URL http://www.cccg.ca/proceedings/2005/31.pdf.
URL http://www.cccg.ca/proceedings/2005/31.ps.

28

John Fischer and Sariel Har-Peled.
Dynamic well-separated pair decomposition made easy.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 235-238, 2005.
URL http://www.cccg.ca/proceedings/2005/32.pdf.
URL http://www.cccg.ca/proceedings/2005/32.ps.

29

Stephane Durocher and David Kirkpatrick.
The projection median of a set of points in $R^2$.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 47-51, 2005.
URL http://www.cccg.ca/proceedings/2005/33.pdf.
URL http://www.cccg.ca/proceedings/2005/33.ps.

30

Iris Ashkenazi, Boaz Ben-Moshe, and Jihad El-Sana.
Approximating radio maps.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 72-75, 2005.
URL http://www.cccg.ca/proceedings/2005/34.pdf.
URL http://www.cccg.ca/proceedings/2005/34.ps.

31

Mirela Damian, Robin Flatland, and Joseph O'Rourke.
Unfolding manhattan towers.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 211-214, 2005.
URL http://www.cccg.ca/proceedings/2005/36.pdf.
URL http://www.cccg.ca/proceedings/2005/36.ps.

32

George Kao, Thomas Fevens, and Jaroslav Opatrny.
Position-based routing on 3-d geometric graphs in mobile ad hoc networks.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 88-91, 2005.
URL http://www.cccg.ca/proceedings/2005/37.pdf.
URL http://www.cccg.ca/proceedings/2005/37.ps.

33

Craig Falls, Yuanxin Liu, Jack Snoeyink, and Diane Souvaine.
Testing shortcuts to maintain simplicity in subdivision simplification.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 35-38, 2005.
URL http://www.cccg.ca/proceedings/2005/38.pdf.
URL http://www.cccg.ca/proceedings/2005/38.ps.

34

Carla Binucci and Walter Didimo.
Experiments on area compaction algorithms for orthogonal drawings.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 113-116, 2005.
URL http://www.cccg.ca/proceedings/2005/39.pdf.
URL http://www.cccg.ca/proceedings/2005/39.ps.

35

Shin ichi Tanigawa and Naoki Katoh.
Finding a triangular mesh with a constant number of different edge lengths.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 274-277, 2005.
URL http://www.cccg.ca/proceedings/2005/41.pdf.
URL http://www.cccg.ca/proceedings/2005/41.ps.

36

Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, and Subhas Nandy.
A fast algorithm for point labeling problem.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 155-158, 2005.
URL http://www.cccg.ca/proceedings/2005/42.pdf.
URL http://www.cccg.ca/proceedings/2005/42.ps.

37

Andreas Spillner.
Optimal convex partitions of point sets with few inner points.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 39-42, 2005.
URL http://www.cccg.ca/proceedings/2005/43.pdf.
URL http://www.cccg.ca/proceedings/2005/43.ps.

38

Christophe Weibel and Komei Fukuda.
Computing faces up to k dimensions of a minkowski sum of polytopes.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 256-259, 2005.
URL http://www.cccg.ca/proceedings/2005/44.pdf.
URL http://www.cccg.ca/proceedings/2005/44.ps.

39

Luca Castelli Aleardi, Olivier Devillers, and Gilles Schaeffer.
Dynamic updates of succinct triangulations.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 134-137, 2005.
URL http://www.cccg.ca/proceedings/2005/45.pdf.
URL http://www.cccg.ca/proceedings/2005/45.ps.

40

Gill Barequet and Yuval scharf.
The translation-scale-rotation diagram for point-containing placements of a convex polygon.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 175-178, 2005.
URL http://www.cccg.ca/proceedings/2005/46.pdf.
URL http://www.cccg.ca/proceedings/2005/46.ps.

41

Jean Cardinal, Martine Labbé, Stefan Langerman, and Belén Palop.
Pricing of geometric transportation networks.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 92-96, 2005.
URL http://www.cccg.ca/proceedings/2005/47.pdf.
URL http://www.cccg.ca/proceedings/2005/47.ps.

42

Therese Biedl and Burkay Genc.
Complexity of octagonal and rectangular cartograms.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 117-120, 2005.
URL http://www.cccg.ca/proceedings/2005/48.pdf.
URL http://www.cccg.ca/proceedings/2005/48.ps.

43

Michael Burr, Alexandra Lauric, and Katelyn Mann.
Searching for the center of an ellipse.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 260-263, 2005.
URL http://www.cccg.ca/proceedings/2005/49.pdf.
URL http://www.cccg.ca/proceedings/2005/49.ps.

44

Jack Snoeyink.
Maximum independent set for intervals by divide-prune-and-conquer.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 264-265, 2005.
URL http://www.cccg.ca/proceedings/2005/50.pdf.
URL http://www.cccg.ca/proceedings/2005/50.ps.

45

Bradford Nickerson and Qingxiu Shi.
Approximate orthogonal range search using patricia tries.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 7-10, 2005.
URL http://www.cccg.ca/proceedings/2005/51.pdf.
URL http://www.cccg.ca/proceedings/2005/51.ps.

46

Luc Habert.
Computing bitangents for ellipses.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 294-297, 2005.
URL http://www.cccg.ca/proceedings/2005/52.pdf.
URL http://www.cccg.ca/proceedings/2005/52.ps.

47

Jean Cardinal, Sebastien Collette, and Stefan Langerman.
Region counting distances and region counting circles.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 278-281, 2005.
URL http://www.cccg.ca/proceedings/2005/53.pdf.
URL http://www.cccg.ca/proceedings/2005/53.ps.

48

Therese Biedl, Joseph Horton, and Alejandro Lopez-Ortiz.
Cross-stitching using little thread.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 199-202, 2005.
URL http://www.cccg.ca/proceedings/2005/54.pdf.
URL http://www.cccg.ca/proceedings/2005/54.ps.

49

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, and Linqiao Zhang.
An experimental assessment of the 2d visibility complex.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 298-301, 2005.
URL http://www.cccg.ca/proceedings/2005/55.pdf.
URL http://www.cccg.ca/proceedings/2005/55.ps.

50

Dominique Michelucci, Sebti Foufou, Loic Lamarque, and David Menegaux.
Bernstein based arithmetic featuring de casteljau.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 215-218, 2005.
URL http://www.cccg.ca/proceedings/2005/58.pdf.
URL http://www.cccg.ca/proceedings/2005/58.ps.

51

W Randolph Franklin.
Nearest point query on 184m points in e3 with a uniform grid.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 239-242, 2005.
URL http://www.cccg.ca/proceedings/2005/59.pdf.
URL http://www.cccg.ca/proceedings/2005/59.ps.

52

Stirling Chow and Frank Ruskey.
Area-proportional drawings of intersecting families of simple closed curves.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 121-124, 2005.
URL http://www.cccg.ca/proceedings/2005/60.pdf.
URL http://www.cccg.ca/proceedings/2005/60.ps.

53

Prosenjit Bose and Jason Morrison.
Translating a star over a point set.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 179-182, 2005.
URL http://www.cccg.ca/proceedings/2005/62.pdf.
URL http://www.cccg.ca/proceedings/2005/62.ps.

54

Csaba Toth and Diane Souvaine.
A vertex-face assignment for plane graphs.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 138-141, 2005.
URL http://www.cccg.ca/proceedings/2005/63.pdf.
URL http://www.cccg.ca/proceedings/2005/63.ps.

55

Sherif Ghali and Chris Smith.
Computing the boundary of a class of labeled-leaf bsp solids.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 159-162, 2005.
URL http://www.cccg.ca/proceedings/2005/64.pdf.
URL http://www.cccg.ca/proceedings/2005/64.ps.

56

Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, and Steve Wismath.
Maintaining visibility information of planar point sets with a moving viewpoint.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 302-305, 2005.
URL http://www.cccg.ca/proceedings/2005/65.pdf.
URL http://www.cccg.ca/proceedings/2005/65.ps.

57

Daya Gaur and Ramesh Krishnamurti.
Faster approximation algorithms for scheduling tasks with a choice of start times.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 11-14, 2005.
URL http://www.cccg.ca/proceedings/2005/66.pdf.
URL http://www.cccg.ca/proceedings/2005/66.ps.

58

Raquel Viana.
Compactly encoding and decoding the connectivity of a plane graph in linear time.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 142-145, 2005.
URL http://www.cccg.ca/proceedings/2005/67.pdf.
URL http://www.cccg.ca/proceedings/2005/67.ps.

59

Timothy Chan and Abdullah-Al Mahmood.
Approximating the piercing number for unit-height rectangles.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 15-18, 2005.
URL http://www.cccg.ca/proceedings/2005/68.pdf.
URL http://www.cccg.ca/proceedings/2005/68.ps.

60

Peyman Afshani and Timothy Chan.
Approximation algorithms for maximum cliques in 3d unit-disk graphs.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 19-22, 2005.
URL http://www.cccg.ca/proceedings/2005/69.pdf.
URL http://www.cccg.ca/proceedings/2005/69.ps.

61

Robert Scot Drysdale, Clifford Stein, and David P. Wagner.
An $o(n^{5/2}\log n)$ algorithm for the rectilinear minimum link-distance problem.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 97-100, 2005.
URL http://www.cccg.ca/proceedings/2005/70.pdf.
URL http://www.cccg.ca/proceedings/2005/70.ps.

62

Valentin Polishchuk and Joseph Mitchell.
k-link rectilinear shortest paths among rectilinear obstacles in the plane.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 101-104, 2005.
URL http://www.cccg.ca/proceedings/2005/71.pdf.
URL http://www.cccg.ca/proceedings/2005/71.ps.

63

Audrey Lee, Ileana Streinu, and Louis Theran.
Finding and maintaining rigid components.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 219-222, 2005.
URL http://www.cccg.ca/proceedings/2005/72.pdf.
URL http://www.cccg.ca/proceedings/2005/72.ps.

64

Robert Benkoczi, Binay Bhattacharya, Sandip Das, and Jeff Sember.
Collection depot location problem in the plane.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 76-79, 2005.
URL http://www.cccg.ca/proceedings/2005/73.pdf.
URL http://www.cccg.ca/proceedings/2005/73.ps.

65

Ramaswamy Chandrasekaran, Ovidiu Daescu, and Jun Luo.
Cutting out polygons.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 183-186, 2005.
URL http://www.cccg.ca/proceedings/2005/74.pdf.
URL http://www.cccg.ca/proceedings/2005/74.ps.

66

Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, and Carlos Seara.
Small weak epsilon nets.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 52-56, 2005.
URL http://www.cccg.ca/proceedings/2005/75.pdf.
URL http://www.cccg.ca/proceedings/2005/75.ps.

67

Boaz Ben-Moshe, Binay Bhattacharya, and Qiaosheng Shi.
Farthest neighbor voronoi diagram in the presence of rectangular obstacles.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 243-246, 2005.
URL http://www.cccg.ca/proceedings/2005/76.pdf.
URL http://www.cccg.ca/proceedings/2005/76.ps.

68

Jonathan Lenchner and Herve Bronnimann.
Observations and computations in sylvester-gallai theory.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 57-60, 2005.
URL http://www.cccg.ca/proceedings/2005/77.pdf.
URL http://www.cccg.ca/proceedings/2005/77.ps.

69

Valentin Polishchuk and Joseph Mitchell.
Touring convex bodies - a conic programming solution.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 290-293, 2005.
URL http://www.cccg.ca/proceedings/2005/78.pdf.
URL http://www.cccg.ca/proceedings/2005/78.ps.

70

Timothy Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, and Vincent Yeung.
Dynamic ham-sandwich cuts of convex polygons in the plane.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 61-64, 2005.
URL http://www.cccg.ca/proceedings/2005/79.pdf.
URL http://www.cccg.ca/proceedings/2005/79.ps.

71

Jack Snoeyink and Ileana Streinu.
Computing rigid components of pseudo-triangulation mechanisms in linear time.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 223-226, 2005.
URL http://www.cccg.ca/proceedings/2005/80.pdf.
URL http://www.cccg.ca/proceedings/2005/80.ps.

72

Demian Nave and Nikos Chrisochoides.
Boundary refinement in delaunay mesh generation using arbitrarily ordered vertex insertion.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 282-285, 2005.
URL http://www.cccg.ca/proceedings/2005/81.pdf.
URL http://www.cccg.ca/proceedings/2005/81.ps.

73

Boaz Ben-Moshe, Binay Bhattacharya, and Qiaosheng Shi.
Computing the widest empty boomerang.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 80-83, 2005.
URL http://www.cccg.ca/proceedings/2005/82.pdf.
URL http://www.cccg.ca/proceedings/2005/82.ps.

74

Chris Worman and Boting Yang.
On the computation and chromatic number of colored domino tilings.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 203-206, 2005.
URL http://www.cccg.ca/proceedings/2005/83.pdf.
URL http://www.cccg.ca/proceedings/2005/83.ps.

75

Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, and David R. Woodk.
The distance geometry of deep rhythms and scales.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 163-166, 2005.
URL http://www.cccg.ca/proceedings/2005/84.pdf.
URL http://www.cccg.ca/proceedings/2005/84.ps.