Gill Barequet

According to our database1, Gill Barequet authored at least 121 papers between 1994 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms.
J. Comput. Geom., 2020

2019
An improved lower bound on the growth constant of polyiamonds.
J. Comb. Optim., 2019

Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes.
CoRR, 2019

Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition).
Proceedings of the 35th International Symposium on Computational Geometry, 2019

A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Polycubes with Small Perimeter Defect.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Properties of Minimal-Perimeter Polyominoes.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Recovering highly-complex linear recurrences of integer sequences.
Inf. Process. Lett., 2017

Enumerating Polyominoes with Fixed Perimeter Defect.
Electron. Notes Discret. Math., 2017

Counting n-cell polycubes proper in n-k dimensions.
Eur. J. Comb., 2017

Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
The Flip Diameter of Rectangulations and Convex Subdivisions.
Discret. Math. Theor. Comput. Sci., 2016

Diffuse reflection diameter in simple polygons.
Discret. Appl. Math., 2016

<i>λ</i> > 4: an improved lower bound on the growth constant of polyominoes.
Commun. ACM, 2016

2015
Automatic Proofs for Formulae Enumerating Proper Polycubes.
Electron. Notes Discret. Math., 2015

An Improved Upper Bound on the Growth Constant of Polyominoes.
Electron. Notes Discret. Math., 2015

λ > 4.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Cut equivalence of d-dimensional guillotine partitions.
Discret. Math., 2014

Offset polygon and annulus placement problems.
Comput. Geom., 2014

Formulae for Polyominoes on Twisted Cylinders.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
On 2-Site Voronoi Diagrams Under Geometric Distance Functions.
J. Comput. Sci. Technol., 2013

Editor's Foreword.
Int. J. Comput. Geom. Appl., 2013

Diffuse Reflections in Simple Polygons.
Electron. Notes Discret. Math., 2013

Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3.
Discret. Math., 2013

Bounded-degree polyhedronization of point sets.
Comput. Geom., 2013

Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations.
Electron. J. Comb., 2013

On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions.
Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

Polyominoes on twisted cylinders.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
A polyominoes-permutations injection and tree-like convex polyominoes.
J. Comb. Theory, Ser. A, 2012

2011
On Multiplicatively Weighted Voronoi Diagrams for Lines in the Plane.
Trans. Comput. Sci., 2011

The Growth Rate of High-Dimensional Tree Polycubes.
Electron. Notes Discret. Math., 2011

Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions.
Comput. Aided Des., 2011

Redelmeier's algorithm for counting lattice animals.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Proper n-Cell Polycubes in n - 3 Dimensions.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Parallel Enumeration of Lattice Animals.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
On the Triangle-Perimeter Two-Site Voronoi Diagram.
Trans. Comput. Sci., 2010

Shape approximation by differential properties of scalar functions.
Comput. Graph., 2010

On 2-Site Voronoi Diagrams under Arithmetic Combinations of Point-to-Point Distances.
Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Solving General Lattice Puzzles.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009
Counting d-Dimensional Polycubes and nonrectangular Planar polyominoes.
Int. J. Comput. Geom. Appl., 2009

Formulae and Growth Rates of High-Dimensional Polycubes.
Electron. Notes Discret. Math., 2009

Counting polycubes without the dimensionality curse.
Discret. Math., 2009

Reconstruction of Multi-Label Domains from Partial Planar Cross-Sections.
Comput. Graph. Forum, 2009

On Voronoi Diagrams for Lines in the Plane.
Proceedings of the Selected Papers of the 2009 International Conference on Computational Science and Its Applications, 2009

Straight skeletons of three-dimensional polyhedra.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Guest editor's foreword.
Vis. Comput., 2008

Nonlinear Interpolation between Slices.
Int. J. Shape Model., 2008

On the Matability of Polygons.
Int. J. Comput. Geom. Appl., 2008

Covering points with a polygon.
Comput. Geom., 2008

Straight Skeletons of Three-Dimensional Polyhedra.
Proceedings of the Algorithms, 2008

2007
On the complexity of Jensen's algorithm for counting fixed polyominoes.
J. Discrete Algorithms, 2007

The On-Line Heilbronn's Triangle Problem in d Dimensions.
Discret. Comput. Geom., 2007

Maximizing the area of an axially symmetric polygon inscribed in a simple polygon.
Comput. Graph., 2007

Heilbronn's triangle problem.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
On the number of rectangulations of a planar point set.
J. Comb. Theory, Ser. A, 2006

The number of guillotine partitions in <i>d</i> dimensions.
Inf. Process. Lett., 2006

A bijection between permutations and floorplans, and its applications.
Discret. Appl. Math., 2006

Algorithms for two-box covering.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

The On-Line Heilbronn's Triangle Problem in <i>d</i> Dimensions.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Counting <i>d</i>-Dimensional Polycubes and Nonrectangular Planar Polyominoes.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Polygon Reconstruction from Line Cross-Sections.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Optimizing a constrained convex polygonal annulus.
J. Discrete Algorithms, 2005

Optimal bounding cones of vectors in three dimensions.
Inf. Process. Lett., 2005

Guest Editor's Foreword.
Int. J. Comput. Geom. Appl., 2005

Two-Dimensional Visibility Charts for Continuous Curves.
Proceedings of the 2005 International Conference on Shape Modeling and Applications (SMI 2005), 2005

An Upper Bound on the Number of Rectangulations of a Point Set.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Large k-D Simplices in the d-Dimensional Cube.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Drawing Planar Graphs with Large Vertices and Thick Edges.
J. Graph Algorithms Appl., 2004

The on-line Heilbronn's triangle problem.
Discret. Math., 2004

Contour interpolation by straight skeletons.
Graph. Model., 2004

On the number of rectangular partitions.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

The Complexity of Jensen's Algorithm for Counting Polyominoes.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Drawing Graphs with Large Vertices and Thick Edges.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Animating a Camera for Viewing a Planar Polygon.
Proceedings of the 8th International Fall Workshop on Vision, Modeling, and Visualization, 2003

Straight-skeleton based contour interpolation.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Morphing between shapes by using their straight skeletons.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
2-Point site Voronoi diagrams.
Discret. Appl. Math., 2002

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.
Algorithmica, 2002

Image Flows and One-Liner Graphical Image Representation.
Proceedings of the 16th International Conference on Pattern Recognition, 2002

The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
A Lower Bound for Heilbronn's Triangle Problem in <i>d</i> Dimensions.
SIAM J. Discret. Math., 2001

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions.
J. Algorithms, 2001

Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard.
Int. J. Comput. Geom. Appl., 2001

A duality between small-face problems in arrangements of lines and Heilbronn-type problems.
Discret. Math., 2001

Voronoi Diagrams for Convex Polygon-Offset Distance Functions.
Discret. Comput. Geom., 2001

Blending polygonal shapes with different topologies.
Comput. Graph., 2001

Efficient perspective-accurate silhouette computation and applications.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2-point site Voronoi diagrams.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices.
Vis. Comput., 2000

w-Searchlight Obedient Graph Drawings.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

Smooth Blending of Polygonal Slices with Different Topologies.
EuroCG, 2000

alpha-Sector of Rational Varieties.
EuroCG, 2000

The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
GeomNet: Geometric Computing Over the Internet.
IEEE Internet Comput., 1999

Partial surface matching by using directed footprints.
Comput. Geom., 1999

Optimizing Constrained Offset and Scaled Polygonal Annuli.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

A Lower Bound for Hellbronn's Triangle Problem in <i>d</i> Dimensions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Bisectors and alpha-Sectors of Rational Varieties.
Proceedings of the Geometric Modelling, Dagstuhl, 1999

Efficient Perspective-Accurate Silhouette Computation.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
RSVP: A Geometric Toolkit for Controlled Repair of Solid Models.
IEEE Trans. Vis. Comput. Graph., 1998

DCEL: A Polyhedral Database and Programming Environment.
Int. J. Comput. Geom. Appl., 1998

Optimizing a Strip Separating Two Polygons.
Graph. Model. Image Process., 1998

On triangulating three-dimensional polygons.
Comput. Geom., 1998

Offset-polygon annulus placement problems.
Comput. Geom., 1998

A data front-end for layered manufacturing.
Comput. Aided Des., 1998

1997
Translating a Convex Polygon to Contain a Maximum Number of Points.
Comput. Geom., 1997

Voronoi Diagrams for Polygon-Offset Distance Functions.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Repairing CAD models.
Proceedings of the 8th IEEE Visualization Conference, 1997

Classical Computational Geometry in GeomNet.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Animating the Polygon-Offset Distance Function.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Piecewise-Linear Interpolation between Polygonal Slices.
Comput. Vis. Image Underst., 1996

BOXTREE: A Hierarchical Representation for Surfaces in 3D.
Comput. Graph. Forum, 1996

History Consideration in Reconstructuring Polythedral Surfaces from Parallel Slices.
Proceedings of the 7th IEEE Visualization Conference, 1996

Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Filling gaps in the boundary of a polyhedron.
Comput. Aided Geom. Des., 1995

1994
Partial surface and volume matching in three dimensions.
Proceedings of the 12th IAPR International Conference on Pattern Recognition, 1994


  Loading...