Prosenjit Bose

Luís Fernando Schultz Xavier da Silveira

Yunkai Wang

Comput. Geom., October, 2023

Competitive Online Search Trees on Trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2023

On approximating shortest paths in weighted triangular tessellations.

[BibT_eX]

[DOI]

Artif. Intell., May, 2023

The Minimum Moving Spanning Tree Problem.

[BibT_eX]

[DOI]

Michiel Smid

J. Graph Algorithms Appl., 2023

The Exact Spanning Ratio of the Parallelogram Delaunay Graph.

[BibT_eX]

[DOI]

Sandrine Njoo

CoRR, 2023

On Separating Path and Tree Systems in Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Connected Dominating Sets in Triangulations.

[BibT_eX]

[DOI]

CoRR, 2023

Geodesic obstacle representation of graphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Luís Fernando Schultz Xavier da Silveira

Comput. Geom., 2023

Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon.

[BibT_eX]

[DOI]

Anthony D'Angelo

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

Parameterized complexity of two-interval pattern problem.

[BibT_eX]

[DOI]

Saeed Mehrabi

Debajyoti Mondal

Theor. Comput. Sci., 2022

Fragile complexity of adaptive algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On the restricted k-Steiner tree problem.

[BibT_eX]

[DOI]

Anthony D'Angelo

J. Comb. Optim., 2022

Separating layered treewidth and row treewidth.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Drawing Graphs as Spanners.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Linear versus centred chromatic numbers.

[BibT_eX]

[DOI]

CoRR, 2022

Computing maximum independent set on outerstring graphs and their relatives.

[BibT_eX]

[DOI]

Comput. Geom., 2022

On the spanning and routing ratios of the directed Θ6-graph.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Comput. Geom., 2022

Bounded-Angle Minimum Spanning Trees.

[BibT_eX]

[DOI]

Algorithmica, 2022

An Optimal Algorithm for Product Structure in Planar Graphs.

[BibT_eX]

[DOI]

Saeed Odak

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

On the Zombie Number of Various Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Local Routing Algorithms on Euclidean Spanners with Small Diameter.

[BibT_eX]

[DOI]

Nicolas Bonichon

Yan Garito

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Piercing Pairwise Intersecting Convex Shapes in the Plane.

[BibT_eX]

[DOI]

Saman Bazargani

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Weighted shortest path in equilateral triangular meshes.

[BibT_eX]

Guillermo Esteban

Anil Maheshwari

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

A 13/9-approximation of the average-2π/3-MST.

[BibT_eX]

Patrick Devaney

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Constrained routing between non-visible vertices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Local routing in WSPD-based spanners.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Dynamic Schnyder Woods.

[BibT_eX]

[DOI]

CoRR, 2021

Improved Spanning on Theta-5.

[BibT_eX]

[DOI]

Darryl Hill

Aurélien Ooms

CoRR, 2021

Attraction-convexity and normal visibility.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Piercing pairwise intersecting geodesic disks.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Affine invariant triangulations.

[BibT_eX]

[DOI]

Pilar Cano

Rodrigo I. Silveira

Comput. Aided Geom. Des., 2021

Faster Multi-sided One-Bend Boundary Labelling.

[BibT_eX]

[DOI]

Saeed Mehrabi

Debajyoti Mondal

Proceedings of the WALCOM: Algorithms and Computation, 2021

Routing on Heavy-Path WSPD-Spanners.

[BibT_eX]

[DOI]

Tyler Tuttle

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Improved Bounds on the Spanning Ratio of the Theta-5-Graph.

[BibT_eX]

[DOI]

Darryl Hill

Aurélien Ooms

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Spanning Properties of Variants of the Delaunay Graph (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Computing the k-Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs.

[BibT_eX]

[DOI]

Olivier Devillers

J. Comput. Geom., 2020

Faster algorithms for some optimization problems on collinear points.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Power domination on triangular grids with triangular and hexagonal shape.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Local Routing in Convex Subdivisions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2020

Asymptotically Optimal Vertex Ranking of Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

(Faster) Multi-Sided Boundary Labelling.

[BibT_eX]

[DOI]

Saeed Mehrabi

Debajyoti Mondal

CoRR, 2020

Gathering by repulsion.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Self-approaching paths in simple polygons.

[BibT_eX]

[DOI]

Irina Kostitsyna

Comput. Geom., 2020

Hamiltonicity for convex shape Delaunay and Gabriel graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Optimal Art Gallery Localization is NP-hard.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Flips in Higher Order Delaunay Triangulations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

On the Restricted 1-Steiner Tree Problem.

[BibT_eX]

[DOI]

Anthony D'Angelo

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Non-Crossing Matching of Online Points.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

A time-space trade-off for computing the k-visibility region of a point in a polygon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Pole Dancing: 3D Morphs for Tree Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2019

Improved Bounds for Guarding Plane Graphs with Edges.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs.

[BibT_eX]

[DOI]

Olivier Devillers

CoRR, 2019

On Plane Constrained Bounded-Degree Spanners.

[BibT_eX]

[DOI]

Algorithmica, 2019

Maximum Plane Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

On the Spanning and Routing Ratio of Theta-Four.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Computing the k-Crossing Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Reconstructing a Convex Polygon from Its \omega ω -cloud.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

Ane invariant triangulations.

[BibT_eX]

Pilar Cano

Rodrigo I. Silveira

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Three-Coloring Three-Dimensional Uniform Hypergraphs.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Watchtower for k-crossing Visibility.

[BibT_eX]

Yeganeh Bahoo

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Routing on the visibility graph.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Plane Bichromatic Trees of Low Degree.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Near-Optimal O(k)-Robust Geometric Spanners.

[BibT_eX]

[DOI]

CoRR, 2018

Reconstructing a convex polygon from its ω-cloud.

[BibT_eX]

[DOI]

CoRR, 2018

Editorial: Special issue in memory of Dr. Ferran Hurtado.

[BibT_eX]

[DOI]

Pedro Ramos

Comput. Geom., 2018

Flipping edge-labelled triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Constrained generalized Delaunay graphs are plane spanners.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Improved Spanning Ratio for Low Degree Plane Spanners.

[BibT_eX]

[DOI]

Darryl Hill

Algorithmica, 2018

Spanning Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.

[BibT_eX]

[DOI]

Algorithmica, 2018

Boundary Labeling for Rectangular Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017

A general framework for searching on a line.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Competitive local routing with constraints.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Towards plane spanners of degree 3.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Essential Constraints of Edge-Constrained Proximity Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Competitive Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

New Bounds for Facial Nonrepetitive Colouring.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Art Gallery Localization.

[BibT_eX]

[DOI]

CoRR, 2017

Flips in edge-labelled pseudo-triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Local Routing in Spanners Based on WSPDs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Power Domination on Triangular Grids.

[BibT_eX]

Claire Pennarun

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

On the separation of a polyhedron from its single-part mold.

[BibT_eX]

[DOI]

Dan Halperin

Shahar Shamai

Proceedings of the 13th IEEE Conference on Automation Science and Engineering, 2017

2016

Towards tight bounds on theta-graphs: More is not always better.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

A plane 1.88-spanner for points in convex position.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

The Price of Order.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2016

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

CoRR, 2016

Probing convex polygons with a wedge.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Biased Predecessor Search.

[BibT_eX]

[DOI]

Algorithmica, 2016

The Power and Limitations of Static Binary Search Trees with Lazy Finger.

[BibT_eX]

[DOI]

Algorithmica, 2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Searching on a line: A complete characterization of the optimal solution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

New and improved spanning ratios for Yao graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Packing Plane Perfect Matchings into a Point Set.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

CoRR, 2015

The θ5-graph is a spanner.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Reprint of: Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Visibility-monotonic polygon deflation.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2015

The Shadows of a Cycle Cannot All Be Paths.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Constrained Empty-Rectangle Delaunay Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

One of Ferran Hurtado's favorite topics - Flips.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Surface roughness of rock faces through the curvature of triangulated meshes.

[BibT_eX]

[DOI]

P. Lai

Claire Samson

Comput. Geosci., 2014

Towards Tight Bounds on Theta-Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Towards a General Framework for Searching on a Line and Searching on $m$ Rays.

[BibT_eX]

[DOI]

CoRR, 2014

Making triangulations 4-connected using flips.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Minimum-area enclosing triangle with a fixed angle.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Triangulating and guarding realistic polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.

[BibT_eX]

[DOI]

Algorithmica, 2014

Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Optimal Algorithms for Constrained 1-Center Problems.

[BibT_eX]

[DOI]

Luis Barba

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Convex Hull of Points on a Sphere is a Spanner.

[BibT_eX]

[DOI]

Simon Pratt

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Searching by Panning and Zooming.

[BibT_eX]

[DOI]

John Howat

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Continuous Yao Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

A General Framework to Generate Sizing Systems from 3D Motion Data Applied to Face Mask Design.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on 3D Vision, 2014

2013

Robust Geometric Spanners.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Network Farthest-Point Diagrams.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Coverage with k-transmitters in the presence of obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

Ryuhei Uehara

J. Comb. Optim., 2013

Coloring and Guarding Arrangements.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Bounding the locality of distributed routing algorithms.

[BibT_eX]

[DOI]

Distributed Comput., 2013

New and Improved Spanning Ratios for Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

On plane geometric spanners: A survey and open problems.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Fast local searches and updates in bounded universes.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Some properties of k-Delaunay and k-Gabriel graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Stable Roommates Spanner.

[BibT_eX]

[DOI]

Lilach Chaitman-Yerushalmi

Sébastien Collette

Matthew J. Katz

Comput. Geom., 2013

The θ 5-Graph is a Spanner.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On the Spanning Ratio of Theta-Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Stretch Factor of the Theta-4 Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Revisiting the Problem of Searching on a Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Computing Covers of Plane Forests.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

A History of Distribution-Sensitive Data Structures.

[BibT_eX]

[DOI]

John Howat

Proceedings of the Space-Efficient Data Structures, 2013

2012

Succinct geometric indexes supporting point location queries.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

A distribution-sensitive dictionary with low space overhead.

[BibT_eX]

[DOI]

John Howat

J. Discrete Algorithms, 2012

Skip lift: A probabilistic alternative to red-black trees.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On bounded degree plane strong geometric spanners.

[BibT_eX]

[DOI]

Lilach Chaitman-Yerushalmi

J. Discrete Algorithms, 2012

Automatically Creating Design Models From 3D Anthropometry Data.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Chang Shu

J. Comput. Inf. Sci. Eng., 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Maria Saumell

David R. Wood

Int. J. Comput. Geom. Appl., 2012

π/2-Angle Yao Graphs are Spanners.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2012

The theta-5-graph is a spanner

[BibT_eX]

[DOI]

CoRR, 2012

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Layered Working-Set Trees.

[BibT_eX]

[DOI]

Algorithmica, 2012

Competitive routing in the half-θ6-graph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

On Spanning Properties of Various Delaunay Graphs.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

De-amortizing Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Flips.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Competitive Routing on a Bounded-Degree Plane Spanner.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Optimal Bounds on Theta-Graphs: More is not Always Better.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

On Farthest-Point Information in Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Spanners of additively weighted point sets.

[BibT_eX]

[DOI]

Mathieu Couture

J. Discrete Algorithms, 2011

On Computing Enclosing Isosceles Triangles and Related Problems.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Computing Signed Permutations of Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.

[BibT_eX]

[DOI]

Graphs Comb., 2011

A survey of geodesic paths on 3D surfaces.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Almost all Delaunay triangulations have stretch factor greater than pi/2.

[BibT_eX]

[DOI]

Comput. Geom., 2011

A note on the perimeter of fat objects.

[BibT_eX]

[DOI]

Otfried Cheong

Vida Dujmovic

Comput. Geom., 2011

On a family of strong geometric spanners that admit local routing strategies.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Location-Oblivious Distributed Unit Disk Graph Coloring.

[BibT_eX]

[DOI]

Algorithmica, 2011

A History of Flips in Combinatorial Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Isoperimetric Triangular Enclosure with a Fixed Angle.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

On the Stretch Factor of Convex Delaunay Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2010

Sigma-local graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Morphing of Triangular Meshes in Shape Space.

[BibT_eX]

[DOI]

Int. J. Shape Model., 2010

Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding.

[BibT_eX]

[DOI]

Int. J. Shape Model., 2010

The dilation of the Delaunay triangulation is greater than π/2

[BibT_eX]

[DOI]

CoRR, 2010

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

[BibT_eX]

[DOI]

CoRR, 2010

Odds-On Trees

[BibT_eX]

[DOI]

CoRR, 2010

Pi/2-Angle Yao Graphs are Spanners

[BibT_eX]

[DOI]

CoRR, 2010

Point Location in Disconnected Planar Subdivisions

[BibT_eX]

[DOI]

CoRR, 2010

Computing the Greedy Spanner in Near-Quadratic Time.

[BibT_eX]

[DOI]

Algorithmica, 2010

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Improved Methods For Generating Quasi-gray Codes.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Communication-Efficient Construction of the Plane Localized Delaunay Graph.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

pi/2-Angle Yao Graphs Are Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Should Static Search Trees Ever Be Unbalanced?

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Global Context Descriptors for SURF and MSER Feature Descriptors.

[BibT_eX]

[DOI]

Gail Carmichael

Robert Laganière

Proceedings of the Canadian Conference on Computer and Robot Vision, 2010

Coverage with k-Transmitters in the Presence of Obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

Common Unfoldings of Polyominoes and Polycubes.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Some properties of higher order delaunay and gabriel graphs.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

On the perimeter of fat objects.

[BibT_eX]

[DOI]

Otfried Cheong

Vida Dujmovic

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Minimum enclosing area triangle with a fixed angle.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Spanners of Complete k-Partite Geometric Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Augmented reality on cloth with realistic illumination.

[BibT_eX]

[DOI]

Derek Bradley

Gerhard Roth

Mach. Vis. Appl., 2009

Algorithms for optimal outlier removal.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

A note on the lower bound of edge guards of polyhedral terrains.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2009

Delaunay and diamond Triangulations contain Spanners of Bounded Degree.

[BibT_eX]

[DOI]

Daming Xu

Int. J. Comput. Geom. Appl., 2009

On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Traversing a Set of Points with a Minimum Number of Turns.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Connectivity-preserving transformations of binary images.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2009

Rotationally monotone polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Editorial CCCG 2005.

[BibT_eX]

[DOI]

Asish Mukhopadhyay

Comput. Geom., 2009

Flips in planar graphs.

[BibT_eX]

[DOI]

Ferran Hurtado

Comput. Geom., 2009

Geometric spanners with small chromatic number.

[BibT_eX]

[DOI]

Comput. Geom., 2009

A linear-space algorithm for distance preserving graph embedding.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Clamshell Casting.

[BibT_eX]

[DOI]

Algorithmica, 2009

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Efficient Construction of Near-Optimal Binary and Multiway Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Filling holes in triangular meshes by curve unfolding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Shape Modeling and Applications, 2009

Posture invariant correspondence of triangular meshes in shape space.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Chang Shu

Proceedings of the 12th IEEE International Conference on Computer Vision Workshops, 2009

The spanning ratio of the Delaunay triangulation is greater than pi/2.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Relaxed Gabriel Graphs.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Coarse grained parallel algorithms for graph matching.

[BibT_eX]

[DOI]

Parallel Comput., 2008

A Characterization of the degree sequences of 2-trees.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

On the false-positive rate of Bloom filters.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Editorial.

[BibT_eX]

[DOI]

Thomas Fevens

Comput. Geom., 2008

On local transformations in plane geometric graphs embedded on small grids.

[BibT_eX]

[DOI]

Manuel Abellanas

Alfredo García Olaverri

Comput. Geom., 2008

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Ad Hoc Sens. Wirel. Networks, 2008

Dynamic optimality for skip lists and B-trees.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Isometric Morphing of Triangular Meshes.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Smallest enclosing circle centered on a query line segment.

[BibT_eX]

Sasanka Roy

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Simultaneous diagonal flips in plane triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Posture Invariant Correspondence of Incomplete Triangular Manifolds.

[BibT_eX]

[DOI]

Int. J. Shape Model., 2007

A General Approximation Algorithm for Planar Maps with Applications.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

Geodesic Ham-Sandwich Cuts.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Space-efficient geometric divide-and-conquer algorithms.

[BibT_eX]

[DOI]

Comput. Geom., 2007

On the stabbing number of a random Delaunay triangulation.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Reconfiguring Triangulations with Edge Flips and Point Moves.

[BibT_eX]

[DOI]

Greg Aloupis

Algorithmica, 2007

On Generalized Diamond Spanners.

[BibT_eX]

[DOI]

Aaron Lee

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Optimal Point Set Partitioning using Rigid Motion Star Placement.

[BibT_eX]

[DOI]

Jason Morrison

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Approximations of Geodesic Distances for Incomplete Triangular Manifolds.

[BibT_eX]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Linear-Space Algorithms for Distance Preserving Embedding.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Vertex Pops and Popturns.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

On the Spanning Ratio of Gabriel Graphs and beta-Skeletons.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Area-preserving approximations of polygonal paths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Partitions of complete geometric graphs into plane trees.

[BibT_eX]

[DOI]

Comput. Geom., 2006

Equitable subdivisions within polygonal regions.

[BibT_eX]

[DOI]

Sergey Bereg

David G. Kirkpatrick

Comput. Geom., 2006

Induced Subgraphs of Bounded Degree and Bounded Treewidth.

[BibT_eX]

[DOI]

Vida Dujmovic

David R. Wood

Contributions Discret. Math., 2006

Feature-based cut detection with automatic threshold selection.

[BibT_eX]

[DOI]

Robert Laganière

Proceedings of the 2006 TREC Video Retrieval Evaluation, 2006

Persistent realtime building interior generation.

[BibT_eX]

[DOI]

Evan Hahn

Proceedings of the 2006 ACM SIGGRAPH symposium on Videogames, 2006

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

On the Stretch Factor of the Constrained Delaunay Triangulation.

[BibT_eX]

[DOI]

J. Mark Keil

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Diamond Triangulations Contain Spanners of Bounded Degree.

[BibT_eX]

[DOI]

Daming Xu

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Lazy Generation of Building Interiors in Realtime.

[BibT_eX]

[DOI]

Evan Hahn

Proceedings of the Canadian Conference on Electrical and Computer Engineering, 2006

Optimal Polygon Placement.

[BibT_eX]

[DOI]

Jason Morrison

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Computing the Tool Path of an Externally Monotone Polygon in Linear Time.

[BibT_eX]

[DOI]

David Bremner

Diane L. Souvaine

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Optimizing a constrained convex polygonal annulus.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2005

Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Algorithmica, 2005

Constructing Plane Spanners of Bounded Degree and Low Weight.

[BibT_eX]

[DOI]

Joachim Gudmundsson

Algorithmica, 2005

Temporal Synchronization of Video Sequences in Theory and in Practice.

[BibT_eX]

[DOI]

Robert Laganière

Proceedings of the 7th IEEE Workshop on Applications of Computer Vision / IEEE Workshop on Motion and Video Computing (WACV/MOTION 2005), 2005

Approximate Range Mode and Range Median Queries.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

High-speed texture-preserving digital image inpainting.

[BibT_eX]

Veronique Audet

Proceedings of the Signal and Image Processing (SIP 2005), 2005

On properties of higher-order Delaunay graphs with applications.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Translating a Star over a Point Set.

[BibT_eX]

[DOI]

Jason Morrison

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Competitive online routing in geometric graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Online Routing in Triangulations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2004

Packing two disks into a polygonal environment.

[BibT_eX]

[DOI]

Antoine Vigneron

J. Discrete Algorithms, 2004

Light edges in degree-constrained graphs.

[BibT_eX]

[DOI]

David R. Wood

Discret. Math., 2004

Approximating geometric bottleneck shortest paths.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Ordered theta graphs.

[BibT_eX]

[DOI]

Joachim Gudmundsson

Comput. Geom., 2004

On simplifying dot maps.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Testing the Quality of Manufactured Disks and Balls.

[BibT_eX]

[DOI]

Algorithmica, 2004

Weighted Ham-Sandwich Cuts.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

On computing enclosing isosceles triangles and related problems.

[BibT_eX]

[DOI]

Carlos Seara

Saurabh Sethia

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Computing nice sweeps for polyhedra and polygons.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Asymmetric Communication Protocols via Hotlink Assignments.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

Properties of Arrangement Graphs.

[BibT_eX]

[DOI]

Hazel Everett

Stephen K. Wismath

Int. J. Comput. Geom. Appl., 2003

Fast approximations for sums of distances, clustering and the Fermat-Weber problem.

[BibT_eX]

[DOI]

Anil Maheshwari

Comput. Geom., 2003

Translating a regular grid over a point set.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Zaiqing Li

Comput. Geom., 2003

Bounds for Frequency Estimation of Packet Streams.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002

Station Layouts in the Presence of Location Constraints.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2002

Finding Specified Sections of Arrangements: 2D Results.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

An Improved Algorithm for Subdivision Traversal without Extra Storage.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

Diamonds are Not a Minimum Weight Triangulation's Best Friend.

[BibT_eX]

[DOI]

William S. Evans

Int. J. Comput. Geom. Appl., 2002

Online Routing in Convex Subdivisions.

[BibT_eX]

[DOI]

Alejandro López-Ortiz

J. Ian Munro

Int. J. Comput. Geom. Appl., 2002

Efficient visibility queries in simple polygons.

[BibT_eX]

[DOI]

Anna Lubiw

J. Ian Munro

Comput. Geom., 2002

On embedding an outer-planar graph in a point set.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Experimental results on quadrangulations of sets of fixed points.

[BibT_eX]

[DOI]

Suneeta Ramaswami

Alain Turki

Comput. Aided Geom. Des., 2002

Separating an object from its cast.

[BibT_eX]

[DOI]

Comput. Aided Des., 2002

Some Aperture-Angle Optimization Problems.

[BibT_eX]

[DOI]

Algorithmica, 2002

Facility Location Constrained to a Polygonal Domain.

[BibT_eX]

[DOI]

Qingda Wang

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Succinct Data Structures for Approximating Convex Functions with Applications.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2001

Efficient Algorithms for Petersen's Matching Theorem.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Every Set of Disjoint Line Segments Admits a Binary Tree.

[BibT_eX]

[DOI]

Michael E. Houle

Discret. Comput. Geom., 2001

The Grid Placement Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

2000

Strategies for Hotlink Assignments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Flipping your Lid.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Drawing Nice Projections of Objects in Space.

[BibT_eX]

[DOI]

J. Vis. Commun. Image Represent., 1999

Testing the Quality of Manufactured Balls.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Optimizing Constrained Offset and Scaled Polygonal Annuli.

[BibT_eX]

[DOI]

Gill Barequet

Matthew Dickerson

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

Near optimal-partitioning of rectangles and prisms.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

A Visibility Representation for Graphs in Three Dimensions.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Pattern Matching for Permutations.

[BibT_eX]

[DOI]

Jonathan F. Buss

Anna Lubiw

Inf. Process. Lett., 1998

Intersections with random geometric objects.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Filling polyhedral molds.

[BibT_eX]

[DOI]

Comput. Aided Des., 1998

Computing constrained minimum-width annuli of point sets.

[BibT_eX]

[DOI]

Comput. Aided Des., 1998

Algorithms for Packing Two Circles in a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Polygon Cutting: Revisited.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Testing the Quality of Manufactured Disks and Cylinders.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Cutting rectangles in equal area pieces.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Dominic Lessard

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Detection of text-line orientation.

[BibT_eX]

[DOI]

Jean-Denis Caron

Kilani Ghoudi

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Recovering lines with fixed linear probes.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Optimal Algorithms to Embed Trees in a Point Set.

[BibT_eX]

[DOI]

Michael McAllister

Jack Snoeyink

J. Graph Algorithms Appl., 1997

The Floodlight Problem.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

Guarding Polyhedral Terrains.

[BibT_eX]

[DOI]

Comput. Geom., 1997

Characterizing and efficiently computing quadrangulations of planar point sets.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1997

Determining the Castability of Simple Polyhedra.

[BibT_eX]

[DOI]

David Bremner

Algorithmica, 1997

Feasibility of Design in Stereolithography.

[BibT_eX]

[DOI]

Gordon T. Wilfong

Algorithmica, 1997

1996

All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers.

[BibT_eX]

[DOI]

David Bremner

Comput. Geom., 1996

Characterizing Proximity Trees.

[BibT_eX]

[DOI]

William J. Lenhart

Giuseppe Liotta

Algorithmica, 1996

On Rectangle Visibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

On the Sectional Area of Convex Polytopes.

[BibT_eX]

[DOI]

David Avis

Jack Snoeyink

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application.

[BibT_eX]

[DOI]

Proceedings of the Computer Graphics International Conference, 1996

Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Zaiqing Li

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Approximating Shortest Paths in Arrangements of Lines.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

The Complexity of Rivers in Triangulated Terrains.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Growing a Tree from Its Branches.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Geometric and computational aspects of gravity casting.

[BibT_eX]

[DOI]

Comput. Aided Des., 1995

No Quadrangulation is Extremely Odd.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Aperture angle optimization problems.

[BibT_eX]

[DOI]

Ferran Hurtado

Elsa Omaña-Pulido

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Geometric and computational aspects of manufacturing processes.

[BibT_eX]

[DOI]

Comput. Graph., 1994

Proximity Constraints and Representable Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

K-Guarding Polygons on the Plane.

[BibT_eX]

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Feasability of Design in Stereolithography.

[BibT_eX]

[DOI]

Gordon T. Wilfong