default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIddo Hanniel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j14]Xiang Li
, Adarsh Krishnamurthy, Iddo Hanniel, Sara McMains:
Edge topology construction of Voronoi diagrams of spheres in non-general position. Comput. Graph. 82: 332-342 (2019)- 2017
- [j13]Jonathan Mizrahi, Sijoon Kim, Iddo Hanniel, Myung-Soo Kim, Gershon Elber:
Minkowski sum computation of B-spline surfaces. Graph. Model. 91: 30-38 (2017) - 2014
- [j12]Iddo Hanniel:
Solving multivariate polynomial systems using hyperplane arithmetic and linear programming. Comput. Aided Des. 46: 101-109 (2014) - 2012
- [j11]Iddo Hanniel, Adarsh Krishnamurthy, Sara McMains:
Computing the Hausdorff distance between NURBS surfaces using numerical iteration on the GPU. Graph. Model. 74(4): 255-264 (2012) - [c12]Erez Tsidon, Iddo Hanniel, Isaac Keslassy:
Estimators also need shared values to grow together. INFOCOM 2012: 1889-1897 - 2011
- [j10]Michael Barton, Gershon Elber, Iddo Hanniel:
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests. Comput. Aided Des. 43(8): 1035-1044 (2011) - [j9]Adarsh Krishnamurthy, Sara McMains, Iddo Hanniel:
GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces. Comput. Aided Des. 43(11): 1370-1379 (2011) - [c11]Iddo Hanniel, Kirk Haller:
Direct Rendering of Solid CAD Models on the GPU. CAD/Graphics 2011: 25-32 - 2010
- [j8]Michael Barton, Iddo Hanniel, Gershon Elber, Myung-Soo Kim:
Precise Hausdorff distance computation between polygonal meshes. Comput. Aided Geom. Des. 27(8): 580-591 (2010) - [j7]Iddo Hanniel, Gill Barequet:
On the Triangle-Perimeter Two-Site Voronoi Diagram. Trans. Comput. Sci. 9: 54-75 (2010) - [c10]Michael Barton, Gershon Elber, Iddo Hanniel:
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests. Symposium on Solid and Physical Modeling 2010: 207-212
2000 – 2009
- 2009
- [j6]Iddo Hanniel, Gershon Elber:
Computing the Voronoi cells of planes, spheres and cylinders in R2. Comput. Aided Geom. Des. 26(6): 695-710 (2009) - [j5]Iddo Hanniel, Ron Wein:
An Exact, Complete and Efficient Computation of Arrangements of Bézier Curves. IEEE Trans Autom. Sci. Eng. 6(3): 399-408 (2009) - [c9]Iddo Hanniel, Gill Barequet:
On the Triangle-Perimeter Two-Site Voronoi Diagram. ISVD 2009: 129-136 - [c8]Iddo Hanniel, Kirk Haller:
Solving global geometric constraints on free-form curves. Symposium on Solid and Physical Modeling 2009: 307-312 - 2008
- [c7]Iddo Hanniel, Gershon Elber:
Computing the Voronoi cells of planes, spheres and cylinders in R3. Symposium on Solid and Physical Modeling 2008: 47-58 - 2007
- [b1]Iddo Hanniel:
Robust arrangements and Voronoi diagrams of free-form curves and surfaces. Technion - Israel Institute of Technology, Israel, 2007 - [j4]Iddo Hanniel, Gershon Elber:
Subdivision termination criteria in subdivision multivariate solvers using dual hyperplanes representations. Comput. Aided Des. 39(5): 369-378 (2007) - [j3]Iddo Hanniel, Ramanathan Muthuganapathy, Gershon Elber, Myung-Soo Kim:
Precise Voronoi Cell Extraction of Free-Form Planar Piecewise C1-Continuous Closed Rational Curves. Int. J. Comput. Geom. Appl. 17(5): 453-486 (2007) - [c6]Iddo Hanniel, Ron Wein:
An exact, complete and efficient computation of arrangements of Bézier curves. Symposium on Solid and Physical Modeling 2007: 253-263 - 2006
- [c5]Iddo Hanniel, Gershon Elber:
Subdivision Termination Criteria in Subdivision Multivariate Solvers. GMP 2006: 115-128 - 2005
- [c4]Iddo Hanniel, Ramanathan Muthuganapathy, Gershon Elber, Myung-Soo Kim:
Precise Voronoi cell extraction of free-form rational planar closed curves. Symposium on Solid and Physical Modeling 2005: 51-59 - 2003
- [j2]Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled:
An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. Int. J. Comput. Geom. Appl. 13(6): 463-485 (2003) - 2000
- [j1]Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra:
The Design and Implementation of Planar Maps in CGAL. ACM J. Exp. Algorithmics 5: 13 (2000) - [c3]Iddo Hanniel, Dan Halperin:
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. WAE 2000: 171-182
1990 – 1999
- 1999
- [c2]Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart:
On-Line Zone Construction in Arrangements of Lines in the Plane. WAE 1999: 139-153 - [c1]Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan:
The Design and Implementation of Planar Maps in CGAL. WAE 1999: 154-168
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 2025-01-09 12:48 CET 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:
