default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEfi Fogel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Nir Goren, Efi Fogel
, Dan Halperin:
Area Optimal Polygonization Using Simulated Annealing. ACM J. Exp. Algorithmics 27: 2.3:1-2.3:17 (2022)- [i4]Nir Goren, Efi Fogel, Dan Halperin:
CGAL Made More Accessible. CoRR abs/2202.13889 (2022) - 2021
- [c14]Tom Tsabar, Efi Fogel, Dan Halperin:
Optimized Synthesis of Snapping Fixtures. WAFR 2021: 143-158
2010 – 2019
- 2019
- [i3]Tom Tsabar, Efi Fogel, Dan Halperin:
Optimized Synthesis of Snapping Fixtures. CoRR abs/1909.05953 (2019) - 2018
- [j10]Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr:
Exact Minkowski sums of polygons with holes. Comput. Geom. 73: 46-56 (2018) - 2015
- [j9]Efi Fogel, Monique Teillaud:
The computational geometry algorithms library CGAL. ACM Commun. Comput. Algebra 49(1): 10-12 (2015) - [c13]Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr:
Exact Minkowski Sums of Polygons With Holes. ESA 2015: 71-82 - [i2]Alon Baram, Efi Fogel, Michael Hemmer, Dan Halperin, Sebastian Morr:
Exact Minkowski Sums of Polygons With Holes. CoRR abs/1502.06195 (2015) - 2013
- [j8]Efi Fogel, Monique Teillaud:
The computational geometry algorithms library CGAL. ACM Commun. Comput. Algebra 47(3/4): 85-87 (2013) - [j7]Efi Fogel, Dan Halperin:
Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact. IEEE Trans Autom. Sci. Eng. 10(2): 227-241 (2013) - 2012
- [b2]Efi Fogel, Dan Halperin, Ron Wein:
CGAL Arrangements and Their Applications - A Step-by-Step Guide. Geometry and Computing 7, Springer 2012, ISBN 978-3-642-17282-3, pp. I-XIX, 1-293 - [c12]Efi Fogel, Michael Hemmer, Asaf Porat, Dan Halperin:
Lines through Segments in 3D Space. ESA 2012: 455-466 - 2011
- [j6]Naama Mayer, Efi Fogel, Dan Halperin:
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Comput. Aided Des. 43(10): 1258-1269 (2011) - 2010
- [j5]Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Math. Comput. Sci. 4(1): 45-66 (2010) - [j4]Eric Berberich, Efi Fogel, Dan Halperin, Michael Kerber, Ophir Setter:
Arrangements on Parametric Surfaces II: Concretizations and Applications. Math. Comput. Sci. 4(1): 67-91 (2010) - [c11]Naama Mayer, Efi Fogel, Dan Halperin:
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Symposium on Solid and Physical Modeling 2010: 1-10
2000 – 2009
- 2009
- [j3]Efi Fogel, Dan Halperin, Christophe Weibel:
On the Exact Maximum Complexity of Minkowski Sums of Polytopes. Discret. Comput. Geom. 42(4): 654-669 (2009) - [e1]John Hershberger, Efi Fogel:
Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009. ACM 2009, ISBN 978-1-60558-501-7 [contents] - [i1]Efi Fogel:
Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere. CoRR abs/0906.3240 (2009) - 2008
- [b1]Efi Fogel:
Minkowski sum construction and other applications of arrangements of geodesic arcs on the sphere. Tel Aviv University, Israel, 2008 - [c10]Efi Fogel, Ophir Setter, Dan Halperin:
Arrangements of geodesic arcs on the sphere. SCG 2008: 218-219 - [c9]Pierre Alliez, Andreas Fabri, Efi Fogel:
Computational geometry algorithms library. SIGGRAPH Classes 2008: 22:1-22:358 - [c8]Efi Fogel, Dan Halperin:
Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact. WAFR 2008: 417-432 - 2007
- [j2]Efi Fogel, Dan Halperin:
Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Comput. Aided Des. 39(11): 929-940 (2007) - [j1]Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin:
Advanced programming techniques applied to Cgal's arrangement package. Comput. Geom. 38(1-2): 37-63 (2007) - [c7]Efi Fogel, Dan Halperin, Christophe Weibel:
On the exact maximum complexity of Minkowski sums of convex polyhedra. SCG 2007: 319-326 - [c6]Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656 - 2006
- [c5]Efi Fogel, Dan Halperin:
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications. ALENEX 2006: 3-15 - 2005
- [c4]Efi Fogel, Dan Halperin:
Exact Minkowski sums of convex polyhedra. SCG 2005: 382-383 - 2004
- [c3]Efi Fogel, Ron Wein, Dan Halperin:
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements. ESA 2004: 664-676 - 2002
- [c2]Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz:
Exact minkowski sums and applications. SCG 2002: 273-274 - 2001
- [c1]Efi Fogel, Daniel Cohen-Or, Revital Ironi, Tali Zvi:
A web architecture for progressive delivery of 3D content. Web3D 2001: 35-41
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
