Ferran Hurtado

Birgit Vogtenhuber

Comput. Geom., 2019

2018

Colored spanning graphs for set visualization.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Pachinko.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

On Contractible Edges in Convex Decompositions.

[BibT_eX]

[DOI]

Eduardo Rivera-Campo

J. Inf. Process., 2017

Distance 2-domination in prisms of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

2016

Configurations of Non-crossing Rays and Related Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

2015

Geometric Biplane Graphs II: Graph Augmentation.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Blocking the k-Holes of Point Sets in the Plane.

[BibT_eX]

[DOI]

Javier Cano

Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Distributed reconfiguration of 2D lattice-based modular robotic systems.

[BibT_eX]

[DOI]

Enrique Molina

Suneeta Ramaswami

Auton. Robots, 2015

2014

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.

[BibT_eX]

[DOI]

Valentin Polishchuk

Theory Comput. Syst., 2014

Mutual witness proximity graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Stabbing Simplices of Point Sets with k-flats.

[BibT_eX]

[DOI]

Javier Cano

Int. J. Comput. Geom. Appl., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Compatible spanning trees.

[BibT_eX]

[DOI]

Clemens Huemer

Comput. Geom., 2014

On k-convex point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Necklaces, Convolutions, and X+Y.

[BibT_eX]

[DOI]

Algorithmica, 2014

Colored Ray Configurations.

[BibT_eX]

[DOI]

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

Order types and cross-sections of line arrangements in R^3.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Birgit Vogtenhuber

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

2013

Proximity graphs inside large weighted graphs.

[BibT_eX]

[DOI]

Networks, 2013

Coverage with k-transmitters in the presence of obstacles.

[BibT_eX]

[DOI]

Diane L. Souvaine

Ryuhei Uehara

J. Comb. Optim., 2013

Proximity Drawings of High-Degree Trees.

[BibT_eX]

[DOI]

Giuseppe Liotta

David R. Wood

Int. J. Comput. Geom. Appl., 2013

Coloring and Guarding Arrangements.

[BibT_eX]

[DOI]

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

Guest Editors' foreword.

[BibT_eX]

[DOI]

Marc J. van Kreveld

Comput. Geom., 2013

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

[BibT_eX]

[DOI]

Comput. Geom., 2013

Witness Gabriel graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Measuring regularity of convex polygons.

[BibT_eX]

[DOI]

Comput. Aided Des., 2013

Terrain Visibility with Multiple Viewpoints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Colored Spanning Graphs for Set Visualization.

[BibT_eX]

[DOI]

Rodrigo I. Silveira

Bettina Speckmann

Proceedings of the Graph Drawing - 21st International Symposium, 2013

On k-Enclosing Objects in a Coloured Point Set.

[BibT_eX]

[DOI]

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

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

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

2012

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

[BibT_eX]

[DOI]

Maria Saumell

David R. Wood

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

Improving Shortest Paths in the Delaunay Triangulation.

[BibT_eX]

[DOI]

Mercè Claverol

Maria Saumell

Rodrigo I. Silveira

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

Token Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

On k-convex polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Bichromatic 2-Center of Pairs of Points.

[BibT_eX]

[DOI]

Piyush Kumar

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Universal Point Subsets for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Coverage restricted to an angle.

[BibT_eX]

[DOI]

António Leslie Bajuelos

Inês Matos

Oper. Res. Lett., 2011

Witness (Delaunay) graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2011

On crossing numbers of geometric proximity graphs.

[BibT_eX]

[DOI]

Vera Sacristán

Maria Saumell

Comput. Geom., 2011

Witness Rectangle Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Convexifying Polygons Without Losing Visibilities.

[BibT_eX]

[DOI]

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

2010

Transforming Triangulations on Nonplanar Surfaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

A Lower Bound on the Area of a 3-Coloured Disk Packing.

[BibT_eX]

[DOI]

Peter Brass

Benjamin J. Lafreniere

Anna Lubiw

Int. J. Comput. Geom. Appl., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.

[BibT_eX]

[DOI]

Sergio Cabello

Discret. Math. Theor. Comput. Sci., 2010

Highway hull revisited.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Augmenting the Connectivity of Outerplanar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2010

Matching Points with Things.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Coverage with k-Transmitters in the Presence of Obstacles.

[BibT_eX]

[DOI]

Diane L. Souvaine

Ryuhei Uehara

Proceedings of the Combinatorial Optimization 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

2009

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

[BibT_eX]

[DOI]

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

On Polygons Enclosing Point Sets II.

[BibT_eX]

[DOI]

Graphs Comb., 2009

On the Chromatic Number of some Flip Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2009

Centerpoint Theorems for Wedges.

[BibT_eX]

[DOI]

Jeff Erickson

Pat Morin

Discret. Math. Theor. Comput. Sci., 2009

Matching Points with Squares.

[BibT_eX]

[DOI]

Mikio Kano

Discret. Comput. Geom., 2009

Gray codes for non-crossing partitions and dissections of a convex polygon.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Connectivity-preserving transformations of binary images.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2009

On triconnected and cubic plane graphs on given point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Flips in planar graphs.

[BibT_eX]

[DOI]

Prosenjit Bose

Comput. Geom., 2009

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

[BibT_eX]

[DOI]

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

2008

The rotation graph of k.

[BibT_eX]

[DOI]

Clemens Huemer

Julian Pfeifle

Inf. Process. Lett., 2008

The Heavy Luggage Metric.

[BibT_eX]

[DOI]

Belén Palop

Int. J. Comput. Geom. Appl., 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Compatible Geometric Matchings.

[BibT_eX]

[DOI]

Sergey Bereg

Adrian Dumitrescu

Electron. Notes Discret. Math., 2008

On polyhedra induced by point sets in space.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Joan Trias

Discret. Appl. Math., 2008

Encompassing colored planar straight line graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Optimal location of transportation devices.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Augmenting the connectivity of geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Draining a Polygon - or - Rolling a Ball out of a Polygon.

[BibT_eX]

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

2007

A General Approximation Algorithm for Planar Maps with Applications.

[BibT_eX]

[DOI]

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

Efficient Many-To-Many Point Matching in One Dimension.

[BibT_eX]

[DOI]

Graphs Comb., 2007

On the Number of Plane Geometric Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2007

On embedding triconnected cubic graphs on point sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Point set stratification and Delaunay depth.

[BibT_eX]

[DOI]

Mercè Claverol

Comput. Stat. Data Anal., 2007

Moving Walkways, Escalators, and Elevators

[BibT_eX]

[DOI]

CoRR, 2007

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Traversing a set of points with a minimum number of turns.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

A Lower Bound on the Area of a 3-Coloured Disc Packing.

[BibT_eX]

[DOI]

Peter Brass

Benjamin J. Lafreniere

Anna Lubiw

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

An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

Some Lower Bounds on Geometric Separability Problems.

[BibT_eX]

[DOI]

Carlos Seara

Steven Skiena

Int. J. Comput. Geom. Appl., 2006

Good Illumination of Minimum Range

[BibT_eX]

[DOI]

António Leslie Bajuelos

Inês Matos

Belén Palop

CoRR, 2006

Computing obnoxious 1-corner polygonal chains.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2006

Moving coins.

[BibT_eX]

[DOI]

Sergey Bereg

David Rappaport

Comput. Geom., 2006

On the number of plane graphs.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Squares.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Necklaces, Convolutions, and X + Y.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

Games on triangulations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Optimal projections onto grids and finite resolution images.

[BibT_eX]

[DOI]

Mario Alberto López

Joan Antoni Sellarès

J. Vis. Commun. Image Represent., 2005

Graphs of Triangulations and Perfect Matchings.

[BibT_eX]

[DOI]

Graphs Comb., 2005

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment

[BibT_eX]

[DOI]

CoRR, 2005

On the chromatic number of some geometric type Kneser graphs.

[BibT_eX]

[DOI]

Comput. Geom., 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

Small weak epsilon nets.

[BibT_eX]

[DOI]

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

Matching Edges and Faces in Polygonal Partitions.

[BibT_eX]

[DOI]

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

2004

A Problem on Hinged Dissections with Colours.

[BibT_eX]

[DOI]

Graphs Comb., 2004

Separability by two lines and by nearly straight polygonal chains.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

The weighted farthest color Voronoi diagram on trees and graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2004

A lower bound on the number of triangulations of planar point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Visualizing Objects with Mirrors.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2004

Small Strictly Convex Quadrilateral Meshes of Point Sets.

[BibT_eX]

[DOI]

Algorithmica, 2004

Matching Points with Circles and Squares.

[BibT_eX]

[DOI]

Mikio Kano

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

On Local Transformations in Plane Geometric Graphs Embedded on Small Grids.

[BibT_eX]

[DOI]

Prosenjit Bose

Proceedings of the Computational Science and Its Applications, 2004

Partitions of Complete Geometric Graphs into Plane Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Separating point sets in polygonal environments.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Geodesic ham-sandwich cuts.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Encompassing colored crossing-free geometric graphs.

[BibT_eX]

[DOI]

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

2003

Voronoi Diagram for services neighboring a highway.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Simultaneous Edge Flipping in Triangulations.

[BibT_eX]

[DOI]

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

Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction.

[BibT_eX]

[DOI]

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

Transforming triangulations of polygons on non planar surfaces

[BibT_eX]

[DOI]

CoRR, 2003

Optimal and suboptimal robust algorithms for proximity graphs.

[BibT_eX]

[DOI]

Giuseppe Liotta

Henk Meijer

Comput. Geom., 2003

Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position.

[BibT_eX]

[DOI]

Comput. Geom., 2003

On a Triangle with the Maximum Area in a Planar Point Set.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Optimal Point Set Projections onto Regular Grids.

[BibT_eX]

[DOI]

Mario Alberto López

Joan Antoni Sellarès

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Red-Blue Separability Problems in 3D.

[BibT_eX]

[DOI]

Carlos Seara

Saurabh Sethia

Proceedings of the Computational Science and Its Applications, 2003

On Polyhedra Induced by Point Sets in Space.

[BibT_eX]

[DOI]

Joan Trias

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Implicit Convex Polygons.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

On the minimum size of visibility graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

On Flips in Polyhedral Surfaces.

[BibT_eX]

[DOI]

Lyuba Alboul

Int. J. Found. Comput. Sci., 2002

Graphs of Non-Crossing Perfect Matchings.

[BibT_eX]

[DOI]

M. Carmen Hernando

Graphs Comb., 2002

Sequences of spanning trees and a fixed tree theorem.

[BibT_eX]

[DOI]

Franz Aurenhammer

Comput. Geom., 2002

Some Aperture-Angle Optimization Problems.

[BibT_eX]

[DOI]

Algorithmica, 2002

Playing with Triangulations.

[BibT_eX]

[DOI]

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

The Largest Empty Annulus Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Nice Perspective Projections.

[BibT_eX]

[DOI]

J. Vis. Commun. Image Represent., 2001

On the number of visibility graphs of simple polygons.

[BibT_eX]

[DOI]

Discret. Math., 2001

Separating objects in the plane by wedges and strips.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs.

[BibT_eX]

[DOI]

Giuseppe Liotta

Henk Meijer

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

On the Reflexivity of Point Sets.

[BibT_eX]

[DOI]

Sándor P. Fekete

Vera Sacristán

Saurabh Sethia

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

Small Convex Quadrangulations of Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Splitting a Delaunay Triangulation in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

Smallest Color-Spanning Objects.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

Towards Compatible Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Separating several point sets in the plane.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

On the number of triangulations every planar point set must have.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Approximation of Point Sets by 1-Corner Polygonal Chains.

[BibT_eX]

[DOI]

Francisco Gómez

INFORMS J. Comput., 2000

A class of point-sets with few k-sets.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Hamiltonicity and colorings of arrangement graphs.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Packing Convex Polygons into Rectangular Boxes.

[BibT_eX]

[DOI]

Helmut Alt

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

On the Equipartitions of Convex Bodies and Convex Polygons.

[BibT_eX]

Roser Guardia

EuroCG, 2000

Some Separability Problems in the Plane.

[BibT_eX]

Carlos Seara

Steven Skiena

EuroCG, 2000

Edge Operations on Non-Crossing Spanning Trees.

[BibT_eX]

Franz Aurenhammer

EuroCG, 2000

On Local Transformation of Polygons with Visibility Properties.

[BibT_eX]

[DOI]

M. Carmen Hernando

Michael E. Houle

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Reconfiguring Convex Polygons.

[BibT_eX]

[DOI]

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

1999

Structural Tolerance and Delaunay Triangulation.

[BibT_eX]

[DOI]

Pedro A. Ramos

Inf. Process. Lett., 1999

Properties of Random Triangulations and Trees.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1999

Geometric Tree Graphs of Points in Convex Position.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Graph of triangulations of a convex polygon and tree of triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 1999

1998

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.

[BibT_eX]

[DOI]

David Avis

Bryan Beresford-Smith

SIAM J. Comput., 1998

Point-Sets with few k-Sets.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Constrainted facility location.

[BibT_eX]

[DOI]

Vera Sacristán

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

Parallel edge flipping.

[BibT_eX]

[DOI]

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

Separating objects in the plane with wedges and strips.

[BibT_eX]

[DOI]

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

Geometric tree graphs of points in the plane.

[BibT_eX]

[DOI]

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

Perspective projections and removal of degeneracies.

[BibT_eX]

[DOI]

Francisco Gómez

Joan Antoni Sellarès

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

Some problems on approximation of set of points by polygonal curves.

[BibT_eX]

[DOI]

Francisco Gómez

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

Finding specified sections of arrangements: 2d results.

[BibT_eX]

[DOI]

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

1997

Counting triangulations of almost-convex polygons.

[BibT_eX]

Ars Comb., 1997

Packing Trees into Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Onion Polygonizations.

[BibT_eX]

[DOI]

Jesus Garcia-Lopez

Oriol Serra

Inf. Process. Lett., 1996

Hiding points in arrangements of segments.

[BibT_eX]

[DOI]

Oriol Serra

Discret. Math., 1996

Ears of triangulations and Catalan numbers.

[BibT_eX]

[DOI]

Discret. Math., 1996

Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Flipping Edges in Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

The Graph of Triangulations of a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Stabbing Information of a Simple Polygon.

[BibT_eX]

[DOI]

Hazel Everett

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

1995

On a Visibility Representation of Graphs.

[BibT_eX]

[DOI]

Francisco Javier Cobos

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

Aperture angle optimization problems.

[BibT_eX]

[DOI]

Prosenjit Bose

Elsa Omaña-Pulido

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

1994

Redrawing a Graph within a Geometric Tolerance.

[BibT_eX]

[DOI]

Pedro A. Ramos

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Tolerance of Geometric Structures.

[BibT_eX]

Pedro A. Ramos

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

Consecutive Guards.

[BibT_eX]

Jesus Garcia-Lopez

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

1993

Updating Polygonizations.

[BibT_eX]

[DOI]

Jesus Garcia-Lopez

Oriol Serra

Comput. Graph. Forum, 1993

Looking through a Window.

[BibT_eX]