default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Kallay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c4]Michael Kallay:
Defining circular arcs on a round earth. COM.Geo 2010
2000 – 2009
- 2008
- [c3]Michael Kallay:
Geometric algorithms on an ellipsoid earth model. GIS 2008: 42 - 2007
- [c2]Michael Kallay:
Defining edges on a round earth. GIS 2007: 63 - 2006
- [j13]Michael Kallay:
Computing the Moment of Inertia of a Solid Defined by a Triangle Mesh. J. Graph. Tools 11(2): 51-57 (2006) - 2003
- [j12]Michael Kallay, Jason Lawrence:
Improving the Two-Pass Resampling Algorithm. J. Graphics, GPU, & Game Tools 8(2): 31-39 (2003) - 2002
- [j11]Michael Kallay:
Computing Tight Bounds for a Bézier Curve. J. Graphics, GPU, & Game Tools 7(3): 13-17 (2002) - 2001
- [j10]Michael Kallay:
A geometric Newton-Raphson strategy. Comput. Aided Geom. Des. 18(8): 797-803 (2001)
1990 – 1999
- 1995
- [j9]Richard D. Fuhr, Lwo Hsieh, Michael Kallay:
Object-oriented paradigm for curve and surface design. Comput. Aided Des. 27(2): 95-100 (1995) - 1993
- [c1]Michael Kallay:
Constrained Optimization in Surface Design. Modeling in Computer Graphics 1993: 85-93 - 1992
- [j8]Damien N. Berger, Michael Kallay:
Computing the unit normal on a degenerate edge. Comput. Aided Des. 24(7): 395-396 (1992) - [j7]Richard D. Fuhr, Michael Kallay:
Monotone linear rational spline interpolation. Comput. Aided Geom. Des. 9(4): 313-319 (1992) - [j6]R. J. Gardner, Michael Kallay:
Subdivision Algorithms and the Kernel of a Polyhedron. Discret. Comput. Geom. 8: 417-427 (1992) - 1991
- [j5]Michael Kallay:
General b-spline hermite interpolation. Comput. Aided Geom. Des. 8(2): 159-161 (1991) - 1990
- [j4]Michael Kallay, Bahram Ravani
:
Optimal twist vectors as a tool for interpolating a network of curves with a minimum energy surface. Comput. Aided Geom. Des. 7(6): 465-473 (1990)
1980 – 1989
- 1986
- [j3]Michael Kallay:
Convex Hull Made Easy. Inf. Process. Lett. 22(3): 161 (1986) - [j2]Michael Kallay:
Plane curves of minimal energy. ACM Trans. Math. Softw. 12(3): 219-222 (1986) - 1984
- [j1]Michael Kallay:
The Complexity of Incremental Convex Hull Algorithms in Rd. Inf. Process. Lett. 19(4): 197 (1984)
1970 – 1979
- 1979
- [b1]Michael Kallay:
פריקות של פאונים קמורים (Decomposibility of convex polytopes.). Hebrew University of Jerusalem, Israel, 1979
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-21 00:07 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:
