The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gill Barequet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gill Barequet, Micha Moffie
    The Complexity of Jensen's Algorithm for Counting Polyominoes. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:161-169 [Conf]
  2. Gill Barequet, Matthew Dickerson
    The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  3. Gill Barequet, Jonathan Naor
    Large k-D Simplices in the d-Dimensional Cube. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:31-34 [Conf]
  4. Gill Barequet, Vadim Rogol
    Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:128-131 [Conf]
  5. Gill Barequet, Yuval Scharf
    The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:175-178 [Conf]
  6. Gill Barequet, Barbara Wolfers
    Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:32-37 [Conf]
  7. Eyal Ackerman, Gill Barequet, Ron Y. Pinter
    An Upper Bound on the Number of Rectangulations of a Point Set. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:554-559 [Conf]
  8. Gadi Aleksandrowicz, Gill Barequet
    Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:418-427 [Conf]
  9. Gill Barequet
    A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:44-53 [Conf]
  10. Gill Barequet
    The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:360-369 [Conf]
  11. Gill Barequet, Alina Shaikhet
    The On-Line Heilbronn's Triangle Problem in d Dimensions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:408-417 [Conf]
  12. Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell
    Algorithms for two-box covering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:459-467 [Conf]
  13. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich
    Animating the Polygon-Offset Distance Function. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:479-480 [Conf]
  14. Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia
    Classical Computational Geometry in GeomNet. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:412-414 [Conf]
  15. Gill Barequet, Matthew Dickerson, David Eppstein
    On Triangulating Three-Dimensional Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:38-47 [Conf]
  16. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop
    Efficient Perspective-Accurate Silhouette Computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:417-418 [Conf]
  17. Gill Barequet, Michael T. Goodrich
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:317-326 [Conf]
  18. Gill Barequet, Yuval Kaplan
    A Data Front-End for Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:231-239 [Conf]
  19. Gill Barequet, Micha Sharir
    Piecewise-Linear Interpolation Between Polygonal Slices. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:93-102 [Conf]
  20. Gill Barequet, Micha Sharir
    Partial Surface Matching by Using Directed Footprints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-9 [Conf]
  21. Gill Barequet, Yuval Scharf, Matthew T. Dickerson
    Covering points with a polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:376-377 [Conf]
  22. Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin
    2-point site Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:323-324 [Conf]
  23. Gill Barequet, Evgeny Yakersberg
    Morphing between shapes by using their straight skeletons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:378-379 [Conf]
  24. Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar
    Efficient perspective-accurate silhouette computation and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:60-68 [Conf]
  25. Gill Barequet, Alina Shaikhet
    Heilbronn's triangle problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:127-128 [Conf]
  26. Gill Barequet, Gershon Elber
    alpha-Sector of Rational Varieties. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:35-39 [Conf]
  27. Tatiana Surazhsky, Vitaly Surazhsky, Gill Barequet, Ayellet Tal
    Smooth Blending of Polygonal Slices with Different Topologies. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:40-44 [Conf]
  28. Gill Barequet
    w-Searchlight Obedient Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:321-327 [Conf]
  29. Gershon Elber, Gill Barequet, Myung-Soo Kim
    Bisectors and alpha-Sectors of Rational Varieties. [Citation Graph (0, 0)][DBLP]
    Geometric Modelling, 1999, pp:73-88 [Conf]
  30. Vadim Makhervaks, Gill Barequet, Alfred M. Bruckstein
    Image Flows and One-Liner Graphical Image Representation. [Citation Graph (0, 0)][DBLP]
    ICPR (1), 2002, pp:640-643 [Conf]
  31. Gill Barequet, Amir Vaxman
    Nonlinear interpolation between slices. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid and Physical Modeling, 2007, pp:97-107 [Conf]
  32. Gershon Elber, Robert Sayegh, Gill Barequet, Ralph R. Martin
    Two-Dimensional Visibility Charts for Continuous Curves. [Citation Graph (0, 0)][DBLP]
    SMI, 2005, pp:208-217 [Conf]
  33. Eyal Ackerman, Gill Barequet, Ron Y. Pinter
    On the number of rectangular partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:736-745 [Conf]
  34. Gill Barequet
    A Lower Bound for Hellbronn's Triangle Problem in d Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:76-81 [Conf]
  35. Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner
    Straight-skeleton based contour interpolation. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:119-127 [Conf]
  36. Gill Barequet, Sariel Har-Peled
    Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:82-91 [Conf]
  37. Gill Barequet, Sariel Har-Peled
    Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:862-863 [Conf]
  38. Gill Barequet, Subodh Kumar
    Repairing CAD models. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 1997, pp:363-370 [Conf]
  39. Gill Barequet, Daniel Shapiro, Ayellet Tal
    History Consideration in Reconstructuring Polythedral Surfaces from Parallel Slices. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 1996, pp:149-156 [Conf]
  40. Daniel Brunstein, Gill Barequet, Craig Gotsman
    Animating a Camera for Viewing a Planar Polygon. [Citation Graph (0, 0)][DBLP]
    VMV, 2003, pp:87-94 [Conf]
  41. Gill Barequet, Prosenjit Bose, Matthew Dickerson
    Optimizing Constrained Offset and Scaled Polygonal Annuli. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:62-73 [Conf]
  42. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
    Offset-Polygon Annulus Placement Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:378-391 [Conf]
  43. Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III
    2-Point Site Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:219-230 [Conf]
  44. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
    Voronoi Diagrams for Polygon-Offset Distance Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:200-209 [Conf]
  45. Gill Barequet, Michael T. Goodrich, Chris Riley
    Drawing Graphs with Large Vertices and Thick Edges. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:281-293 [Conf]
  46. Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:150-167 [Journal]
  47. Gill Barequet, Yuval Kaplan
    A data front-end for layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:231-243 [Journal]
  48. Gill Barequet, Micha Sharir
    Filling gaps in the boundary of a polyhedron. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1995, v:12, n:2, pp:207-229 [Journal]
  49. Tatiana Surazhsky, Vitaly Surazhsky, Gill Barequet, Ayellet Tal
    Blending polygonal shapes with different topologies. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2001, v:25, n:1, pp:29-39 [Journal]
  50. Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, Ayellet Tal
    BOXTREE: A Hierarchical Representation for Surfaces in 3D. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1996, v:15, n:3, pp:387-396 [Journal]
  51. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
    Offset-polygon annulus placement problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:125-141 [Journal]
  52. Gill Barequet, Matthew Dickerson, David Eppstein
    On triangulating three-dimensional polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:155-170 [Journal]
  53. Gill Barequet, Matthew T. Dickerson, Petru Pau
    Translating a Convex Polygon to Contain a Maximum Number of Points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:167-179 [Journal]
  54. Gill Barequet, Micha Sharir
    Partial surface matching by using directed footprints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:45-62 [Journal]
  55. Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner
    Contour interpolation by straight skeletons. [Citation Graph (0, 0)][DBLP]
    Graphical Models, 2004, v:66, n:4, pp:245-260 [Journal]
  56. Gill Barequet, Barbara Wolfers
    Optimizing a Strip Separating Two Polygons. [Citation Graph (0, 0)][DBLP]
    Graphical Models and Image Processing, 1998, v:60, n:3, pp:214-221 [Journal]
  57. Gill Barequet, Micha Sharir
    Piecewise-Linear Interpolation between Polygonal Slices. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1996, v:63, n:2, pp:251-272 [Journal]
  58. Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III
    2-Point site Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:37-54 [Journal]
  59. Eyal Ackerman, Gill Barequet, Ron Y. Pinter
    A bijection between permutations and floorplans, and its applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:12, pp:1674-1684 [Journal]
  60. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
    Voronoi Diagrams for Convex Polygon-Offset Distance Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:2, pp:271-291 [Journal]
  61. Gill Barequet
    A duality between small-face problems in arrangements of lines and Heilbronn-type problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:1-12 [Journal]
  62. Gill Barequet
    The on-line Heilbronn's triangle problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:7-14 [Journal]
  63. Gill Barequet
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:325-326 [Journal]
  64. Gill Barequet
    DCEL: A Polyhedral Database and Programming Environment. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:5/6, pp:619-636 [Journal]
  65. Gill Barequet, Sariel Har-Peled
    Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:465-474 [Journal]
  66. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia
    GeomNet: Geometric Computing Over the Internet. [Citation Graph (0, 0)][DBLP]
    IEEE Internet Computing, 1999, v:3, n:2, pp:21-29 [Journal]
  67. Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik
    The number of guillotine partitions in d dimensions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:4, pp:162-167 [Journal]
  68. Gill Barequet, Gershon Elber
    Optimal bounding cones of vectors in three dimensions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:2, pp:83-89 [Journal]
  69. Gill Barequet, Sariel Har-Peled
    Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:91-109 [Journal]
  70. Eyal Ackerman, Gill Barequet, Ron Y. Pinter
    On the number of rectangulations of a planar point set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:6, pp:1072-1091 [Journal]
  71. Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich
    Optimizing a constrained convex polygonal annulus. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:1-26 [Journal]
  72. Gill Barequet, Micha Moffie
    On the complexity of Jensen's algorithm for counting fixed polyominoes. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:348-355 [Journal]
  73. Gill Barequet, Michael T. Goodrich, Chris Riley
    Drawing Planar Graphs with Large Vertices and Thick Edges. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:3-20 [Journal]
  74. Gill Barequet
    A Lower Bound for Heilbronn's Triangle Problem in d Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:230-236 [Journal]
  75. Gill Barequet, Christian A. Duncan, Subodh Kumar
    RSVP: A Geometric Toolkit for Controlled Repair of Solid Models. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 1998, v:4, n:2, pp:162-177 [Journal]
  76. Gill Barequet, Daniel Shapiro, Ayellet Tal
    Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 2000, v:16, n:2, pp:116-133 [Journal]
  77. Gill Barequet, Craig Gotsman, Avishay Sidlesky
    Polygon Reconstruction from Line Cross-Sections. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  78. Gill Barequet, Vadim Rogol
    Maximizing the area of an axially symmetric polygon inscribed in a simple polygon. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2007, v:31, n:1, pp:127-136 [Journal]
  79. Gill Barequet, Alina Shaikhet
    The On-Line Heilbronn's Triangle Problem in d Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:38, n:1, pp:51-60 [Journal]

  80. Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]


  81. Counting Polycubes without the Dimensionality Curse. [Citation Graph (, )][DBLP]


  82. Straight skeletons of three-dimensional polyhedra. [Citation Graph (, )][DBLP]


  83. Straight Skeletons of Three-Dimensional Polyhedra. [Citation Graph (, )][DBLP]


  84. On 2-Site Voronoi Diagrams under Arithmetic Combinations of Point-to-Point Distances. [Citation Graph (, )][DBLP]


  85. On the Triangle-Perimeter Two-Site Voronoi Diagram. [Citation Graph (, )][DBLP]


  86. Solving General Lattice Puzzles. [Citation Graph (, )][DBLP]


  87. Reconstruction of Multi-Label Domains from Partial Planar Cross-Sections. [Citation Graph (, )][DBLP]


  88. Covering points with a polygon. [Citation Graph (, )][DBLP]


  89. Straight Skeletons of Three-Dimensional Polyhedra [Citation Graph (, )][DBLP]


  90. Counting polycubes without the dimensionality curse. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002