![]() | ![]() |
| 2012 | ||
|---|---|---|
| 106 | Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet: A polyominoes-permutations injection and tree-like convex polyominoes. J. Comb. Theory, Ser. A 119(3): 503-520 (2012) | |
| 2011 | ||
| 105 | Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote: Proper n-Cell Polycubes in n - 3 Dimensions. COCOON 2011: 180-191 | |
| 104 | Gadi Aleksandrowicz, Gill Barequet: Parallel Enumeration of Lattice Animals. FAW-AAIM 2011: 90-99 | |
| 103 | Gadi Aleksandrowicz, Gill Barequet: Redelmeier's algorithm for counting lattice animals. Symposium on Computational Geometry 2011: 283-284 | |
| 102 | Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina: On 2-Site Voronoi Diagrams under Geometric Distance Functions CoRR abs/1105.4130: (2011) | |
| 101 | Ramanathan Muthuganapathy, Gershon Elber, Gill Barequet, Myung-Soo Kim: Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions. Computer-Aided Design 43(3): 247-257 (2011) | |
| 100 | Gadi Aleksandrowicz, Gill Barequet: The Growth Rate of High-Dimensional Tree Polycubes. Electronic Notes in Discrete Mathematics 38: 25-30 (2011) | |
| 99 | Kira Vyatkina, Gill Barequet: On Multiplicatively Weighted Voronoi Diagrams for Lines in the Plane. Transactions on Computational Science 13: 44-71 (2011) | |
| 2010 | ||
| 98 | Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow: Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102 | |
| 97 | Gill Barequet, Shahar Tal: Solving General Lattice Puzzles. FAW 2010: 124-135 | |
| 96 | Kira Vyatkina, Gill Barequet: On 2-Site Voronoi Diagrams under Arithmetic Combinations of Point-to-Point Distances. ISVD 2010: 33-41 | |
| 95 | Ronnie Barequet, Gill Barequet, Günter Rote: Formulae and growth rates of high-dimensional polycubes. Combinatorica 30(3): 257-275 (2010) | |
| 94 | Silvia Biasotti, Giuseppe Patanè, Michela Spagnuolo, Bianca Falcidieno, Gill Barequet: Shape approximation by differential properties of scalar functions. Computers & Graphics 34(3): 252-262 (2010) | |
| 93 | Iddo Hanniel, Gill Barequet: On the Triangle-Perimeter Two-Site Voronoi Diagram. Transactions on Computational Science 9: 54-75 (2010) | |
| 2009 | ||
| 92 | Iddo Hanniel, Gill Barequet: On the Triangle-Perimeter Two-Site Voronoi Diagram. ISVD 2009: 129-136 | |
| 91 | Gill Barequet, Amir Vaxman: Straight skeletons of three-dimensional polyhedra. Symposium on Computational Geometry 2009: 100-101 | |
| 90 | Gill Barequet, Amir Vaxman: Reconstruction of Multi-Label Domains from Partial Planar Cross-Sections. Comput. Graph. Forum 28(5): 1327-1337 (2009) | |
| 89 | Gadi Aleksandrowicz, Gill Barequet: Counting polycubes without the dimensionality curse. Discrete Mathematics 309(13): 4576-4583 (2009) | |
| 88 | Ronnie Barequet, Gill Barequet, Günter Rote: Formulae and Growth Rates of High-Dimensional Polycubes. Electronic Notes in Discrete Mathematics 34: 459-463 (2009) | |
| 87 | Gadi Aleksandrowicz, Gill Barequet: Counting d-Dimensional Polycubes and nonrectangular Planar polyominoes. Int. J. Comput. Geometry Appl. 19(3): 215-229 (2009) | |
| 2008 | ||
| 86 | Gadi Aleksandrowicz, Gill Barequet: Counting Polycubes without the Dimensionality Curse. COCOON 2008: 100-109 | |
| 85 | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160 | |
| 84 | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra CoRR abs/0805.0022: (2008) | |
| 83 | Gill Barequet, Matthew T. Dickerson, Yuval Scharf: Covering points with a polygon. Comput. Geom. 39(3): 143-162 (2008) | |
| 82 | Gill Barequet, Aya Steiner: On the Matability of Polygons. Int. J. Comput. Geometry Appl. 18(5): 469-506 (2008) | |
| 81 | Gill Barequet, Amir Vaxman: Nonlinear Interpolation between Slices. International Journal of Shape Modeling 14(1): 39-60 (2008) | |
| 80 | Gill Barequet, Young J. Kim: Guest editor's foreword. The Visual Computer 24(4): 227 (2008) | |
| 2007 | ||
| 79 | Gill Barequet, Alina Shaikhet: Heilbronn's triangle problem. Symposium on Computational Geometry 2007: 127-128 | |
| 78 | Gill Barequet, Amir Vaxman: Nonlinear interpolation between slices. Symposium on Solid and Physical Modeling 2007: 97-107 | |
| 77 | Gill Barequet, Vadim Rogol: Maximizing the area of an axially symmetric polygon inscribed in a simple polygon. Computers & Graphics 31(1): 127-136 (2007) | |
| 76 | Gill Barequet, Alina Shaikhet: The On-Line Heilbronn's Triangle Problem in d Dimensions. Discrete & Computational Geometry 38(1): 51-60 (2007) | |
| 75 | Gill Barequet, Micha Moffie: On the complexity of Jensen's algorithm for counting fixed polyominoes. J. Discrete Algorithms 5(2): 348-355 (2007) | |
| 2006 | ||
| 74 | Gill Barequet, Craig Gotsman, Avishay Sidlesky: Polygon Reconstruction from Line Cross-Sections. CCCG 2006 | |
| 73 | Gill Barequet, Alina Shaikhet: The On-Line Heilbronn's Triangle Problem in d Dimensions. COCOON 2006: 408-417 | |
| 72 | Gadi Aleksandrowicz, Gill Barequet: Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes. COCOON 2006: 418-427 | |
| 71 | Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell: Algorithms for two-box covering. Symposium on Computational Geometry 2006: 459-467 | |
| 70 | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: A bijection between permutations and floorplans, and its applications. Discrete Applied Mathematics 154(12): 1674-1684 (2006) | |
| 69 | Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik: The number of guillotine partitions in d dimensions. Inf. Process. Lett. 98(4): 162-167 (2006) | |
| 68 | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: On the number of rectangulations of a planar point set. J. Comb. Theory, Ser. A 113(6): 1072-1091 (2006) | |
| 2005 | ||
| 67 | Gill Barequet, Yuval Scharf: The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon. CCCG 2005: 175-178 | |
| 66 | Gill Barequet, Jonathan Naor: Large k-D Simplices in the d-Dimensional Cube. CCCG 2005: 31-34 | |
| 65 | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: An Upper Bound on the Number of Rectangulations of a Point Set. COCOON 2005: 554-559 | |
| 64 | Gershon Elber, Robert Sayegh, Gill Barequet, Ralph R. Martin: Two-Dimensional Visibility Charts for Continuous Curves. SMI 2005: 208-217 | |
| 63 | Gill Barequet, Yuval Scharf, Matthew T. Dickerson: Covering points with a polygon. Symposium on Computational Geometry 2005: 376-377 | |
| 62 | Gill Barequet, Gershon Elber: Optimal bounding cones of vectors in three dimensions. Inf. Process. Lett. 93(2): 83-89 (2005) | |
| 61 | Gill Barequet: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 15(4): 325-326 (2005) | |
| 60 | Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich: Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005) | |
| 2004 | ||
| 59 | Gill Barequet, Micha Moffie: The Complexity of Jensen's Algorithm for Counting Polyominoes. ALENEX/ANALC 2004: 161-169 | |
| 58 | Gill Barequet, Vadim Rogol: Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon. CCCG 2004: 128-131 | |
| 57 | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: On the number of rectangular partitions. SODA 2004: 736-745 | |
| 56 | Gill Barequet: The on-line Heilbronn's triangle problem. Discrete Mathematics 283(1-3): 7-14 (2004) | |
| 55 | Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner: Contour interpolation by straight skeletons. Graphical Models 66(4): 245-260 (2004) | |
| 54 | Gill Barequet, Michael T. Goodrich, Chris Riley: Drawing Planar Graphs with Large Vertices and Thick Edges. J. Graph Algorithms Appl. 8: 3-20 (2004) | |
| 2003 | ||
| 53 | Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner: Straight-skeleton based contour interpolation. SODA 2003: 119-127 | |
| 52 | Gill Barequet, Evgeny Yakersberg: Morphing between shapes by using their straight skeletons. Symposium on Computational Geometry 2003: 378-379 | |
| 51 | Daniel Brunstein, Gill Barequet, Craig Gotsman: Animating a Camera for Viewing a Planar Polygon. VMV 2003: 87-94 | |
| 50 | Gill Barequet, Michael T. Goodrich, Chris Riley: Drawing Graphs with Large Vertices and Thick Edges. WADS 2003: 281-293 | |
| 2002 | ||
| 49 | Gill Barequet: The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions. COCOON 2002: 360-369 | |
| 48 | Vadim Makhervaks, Gill Barequet, Alfred M. Bruckstein: Image Flows and One-Liner Graphical Image Representation. ICPR (1) 2002: 640-643 | |
| 47 | Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002) | |
| 46 | Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III: 2-Point site Voronoi diagrams. Discrete Applied Mathematics 122(1-3): 37-54 (2002) | |
| 2001 | ||
| 45 | Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin: 2-point site Voronoi diagrams. Symposium on Computational Geometry 2001: 323-324 | |
| 44 | Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar: Efficient perspective-accurate silhouette computation and applications. Symposium on Computational Geometry 2001: 60-68 | |
| 43 | Tatiana Surazhsky, Vitaly Surazhsky, Gill Barequet, Ayellet Tal: Blending polygonal shapes with different topologies. Computers & Graphics 25(1): 29-39 (2001) | |
| 42 | Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discrete & Computational Geometry 25(2): 271-291 (2001) | |
| 41 | Gill Barequet: A duality between small-face problems in arrangements of lines and Heilbronn-type problems. Discrete Mathematics 237(1-3): 1-12 (2001) | |
| 40 | Gill Barequet, Sariel Har-Peled: Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. Int. J. Comput. Geometry Appl. 11(4): 465-474 (2001) | |
| 39 | Gill Barequet, Sariel Har-Peled: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms 38(1): 91-109 (2001) | |
| 38 | Gill Barequet: A Lower Bound for Heilbronn's Triangle Problem in d Dimensions. SIAM J. Discrete Math. 14(2): 230-236 (2001) | |
| 2000 | ||
| 37 | Gill Barequet, Matthew Dickerson: The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. CCCG 2000 | |
| 36 | Gill Barequet: A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. COCOON 2000: 44-53 | |
| 35 | Gill Barequet, Gershon Elber: alpha-Sector of Rational Varieties. EuroCG 2000: 35-39 | |
| 34 | Tatiana Surazhsky, Vitaly Surazhsky, Gill Barequet, Ayellet Tal: Smooth Blending of Polygonal Slices with Different Topologies. EuroCG 2000: 40-44 | |
| 33 | Gill Barequet: w-Searchlight Obedient Graph Drawings. Graph Drawing 2000: 321-327 | |
| 32 | Gill Barequet, Daniel Shapiro, Ayellet Tal: Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices. The Visual Computer 16(2): 116-133 (2000) | |
| 1999 | ||
| 31 | Gershon Elber, Gill Barequet, Myung-Soo Kim: Bisectors and alpha-Sectors of Rational Varieties. Geometric Modelling 1999: 73-88 | |
| 30 | Gill Barequet: A Lower Bound for Hellbronn's Triangle Problem in d Dimensions. SODA 1999: 76-81 | |
| 29 | Gill Barequet, Sariel Har-Peled: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. SODA 1999: 82-91 | |
| 28 | Gill Barequet, Sariel Har-Peled: Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. SODA 1999: 862-863 | |
| 27 | Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop: Efficient Perspective-Accurate Silhouette Computation. Symposium on Computational Geometry 1999: 417-418 | |
| 26 | Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III: 2-Point Site Voronoi Diagrams. WADS 1999: 219-230 | |
| 25 | Gill Barequet, Prosenjit Bose, Matthew Dickerson: Optimizing Constrained Offset and Scaled Polygonal Annuli. WADS 1999: 62-73 | |
| 24 | Gill Barequet, Micha Sharir: Partial surface matching by using directed footprints. Comput. Geom. 12(1-2): 45-62 (1999) | |
| 23 | Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia: GeomNet: Geometric Computing Over the Internet. IEEE Internet Computing 3(2): 21-29 (1999) | |
| 1998 | ||
| 22 | Gill Barequet, Michael T. Goodrich: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Symposium on Computational Geometry 1998: 317-326 | |
| 21 | Gill Barequet, Matthew Dickerson, David Eppstein: On triangulating three-dimensional polygons. Comput. Geom. 10(3): 155-170 (1998) | |
| 20 | Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-polygon annulus placement problems. Comput. Geom. 11(3-4): 125-141 (1998) | |
| 19 | Gill Barequet, Yuval Kaplan: A data front-end for layered manufacturing. Computer-Aided Design 30(4): 231-243 (1998) | |
| 18 | Gill Barequet, Barbara Wolfers: Optimizing a Strip Separating Two Polygons. Graphical Models and Image Processing 60(3): 214-221 (1998) | |
| 17 | Gill Barequet, Christian A. Duncan, Subodh Kumar: RSVP: A Geometric Toolkit for Controlled Repair of Solid Models. IEEE Trans. Vis. Comput. Graph. 4(2): 162-177 (1998) | |
| 16 | Gill Barequet: DCEL: A Polyhedral Database and Programming Environment. Int. J. Comput. Geometry Appl. 8(5/6): 619-636 (1998) | |
| 1997 | ||
| 15 | Gill Barequet, Subodh Kumar: Repairing CAD models. IEEE Visualization 1997: 363-370 | |
| 14 | Gill Barequet, Yuval Kaplan: A Data Front-End for Layered Manufacturing. Symposium on Computational Geometry 1997: 231-239 | |
| 13 | Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia: Classical Computational Geometry in GeomNet. Symposium on Computational Geometry 1997: 412-414 | |
| 12 | Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich: Animating the Polygon-Offset Distance Function. Symposium on Computational Geometry 1997: 479-480 | |
| 11 | Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Polygon-Offset Distance Functions. WADS 1997: 200-209 | |
| 10 | Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-Polygon Annulus Placement Problems. WADS 1997: 378-391 | |
| 9 | Gill Barequet, Matthew T. Dickerson, Petru Pau: Translating a Convex Polygon to Contain a Maximum Number of Points. Comput. Geom. 8: 167-179 (1997) | |
| 1996 | ||
| 8 | Gill Barequet, Barbara Wolfers: Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation. CCCG 1996: 32-37 | |
| 7 | Gill Barequet, Daniel Shapiro, Ayellet Tal: History Consideration in Reconstructuring Polythedral Surfaces from Parallel Slices. IEEE Visualization 1996: 149-156 | |
| 6 | Gill Barequet, Matthew Dickerson, David Eppstein: On Triangulating Three-Dimensional Polygons. Symposium on Computational Geometry 1996: 38-47 | |
| 5 | Gill Barequet, Micha Sharir: Partial Surface Matching by Using Directed Footprints. Symposium on Computational Geometry 1996: C-9-C-10 | |
| 4 | Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, Ayellet Tal: BOXTREE: A Hierarchical Representation for Surfaces in 3D. Comput. Graph. Forum 15(3): 387-396 (1996) | |
| 3 | Gill Barequet, Micha Sharir: Piecewise-Linear Interpolation between Polygonal Slices. Computer Vision and Image Understanding 63(2): 251-272 (1996) | |
| 1995 | ||
| 2 | Gill Barequet, Micha Sharir: Filling gaps in the boundary of a polyhedron. Computer Aided Geometric Design 12(2): 207-229 (1995) | |
| 1994 | ||
| 1 | Gill Barequet, Micha Sharir: Piecewise-Linear Interpolation Between Polygonal Slices. Symposium on Computational Geometry 1994: 93-102 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page