default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil F. Stewart
Person information
- affiliation: University of Montréal, Montréal, Québec, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j27]Peihui Shao, Neil F. Stewart:
Managing uncertainty and discontinuous condition numbers in geometric computation. Soft Comput. 17(8): 1425-1437 (2013)- 2012
- [j26]Vincent Nivoliers, Cédric Gérot, Victor Ostromoukhov, Neil F. Stewart:
L-system specification of knot-insertion rules for non-uniform B-spline subdivision. Comput. Aided Geom. Des. 29(2): 150-161 (2012) - 2010
- [b1]Lars-Erik Andersson, Neil F. Stewart:
Introduction to the Mathematics of Subdivision Surfaces. SIAM 2010, ISBN 978-0-89871-697-9, pp. I-XXIV, 1-356
2000 – 2009
- 2009
- [j25]Di Jiang, Neil F. Stewart:
Floating-Point Arithmetic for Computational Geometry Problems with Uncertain Data. Int. J. Comput. Geom. Appl. 19(4): 371-385 (2009) - 2008
- [c5]Di Jiang, Neil F. Stewart:
Robustness of Boolean Operations on Subdivision-Surface Models. Numerical Validation in Current Hardware Architectures 2008: 161-174 - [c4]Neil F. Stewart, Malika Zidani:
Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling. Reliable Implementation of Real Number Algorithms 2008: 181-192 - [i3]Di Jiang, Neil F. Stewart:
Robustness of Boolean operations on subdivision-surface models. Numerical Validation in Current Hardware Architectures 2008 - 2007
- [j24]Lars-Erik Andersson, Neil F. Stewart, Malika Zidani:
Error Analysis for Operations in Solid Modeling in the Presence of Uncertainty. SIAM J. Sci. Comput. 29(2): 811-826 (2007) - 2006
- [j23]Jianchang Qi, Vadim Shapiro, Neil F. Stewart:
Single-set and class-of-sets semantics for geometric models. Comput. Aided Des. 38(10): 1088-1098 (2006) - [j22]Lars-Erik Andersson, Neil F. Stewart, Malika Zidani:
Conditions for use of a non-selfintersection conjecture. Comput. Aided Geom. Des. 23(7): 599-611 (2006) - [c3]Di Jiang, Neil F. Stewart:
Backward Error Analysis in Computational Geometry. ICCSA (1) 2006: 50-59 - [i2]Neil F. Stewart, Malika Zidani:
Transfinite interpolation for well-definition in error analysis in solid modelling. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [j21]Christoph M. Hoffmann, Neil F. Stewart:
Accuracy and semantics in shape-interrogation applications. Graph. Model. 67(5): 373-389 (2005) - [i1]Edward L. F. Moore, Thomas J. Peters, David R. Ferguson, Neil F. Stewart:
Integrating Topology and Geometry for Macro-Molecular Simulations. Spatial Representation 2005 - 2004
- [j20]Richard Egli, Neil F. Stewart:
Chain models in computer simulation. Math. Comput. Simul. 66(6): 449-468 (2004) - [c2]Christoph M. Hoffmann, Gahyun Park, J.-R. Simard, Neil F. Stewart:
Residual iteration and accurate polynomial evaluation for shape-interrogation applications. Symposium on Solid Modeling and Applications 2004: 9-14 - 2003
- [j19]C. Mow, Thomas J. Peters, Neil F. Stewart:
Specifying useful error bounds for geometry tools: an intersector exemplar. Comput. Aided Geom. Des. 20(5): 247-251 (2003) - 2000
- [j18]Richard Egli, Neil F. Stewart:
A framework for system specification using chains on cell complexes. Comput. Aided Des. 32(7): 447-459 (2000) - [j17]Lars-Erik Andersson, Thomas J. Peters, Neil F. Stewart:
Equivalence of Topological Form for Curvilinear Geometric Objects. Int. J. Comput. Geom. Appl. 10(6): 609-622 (2000)
1990 – 1999
- 1999
- [j16]Richard Egli, Neil F. Stewart:
A framework for system specification using chains on cell complexes. Comput. Aided Des. 31(11): 669-681 (1999) - 1998
- [j15]Lars-Erik Andersson, Thomas J. Peters, Neil F. Stewart:
Selfintersection of composite curves and surfaces. Comput. Aided Geom. Des. 15(5): 507-527 (1998) - 1997
- [c1]Thomas J. Peters, Neil F. Stewart, David R. Ferguson, P. S. Fussell:
Algorithmic Tolerances and Semantics in Data Exchange. SCG 1997: 403-405 - 1996
- [j14]Richard Egli, C. Petit, Neil F. Stewart:
Moving coordinate frames for representation and visualization in four dimensions. Comput. Graph. 20(6): 905-919 (1996) - 1995
- [j13]Lars-Erik Andersson, Thomas J. Peters, Neil F. Stewart, S. M. Doney:
Polyhedral perturbations that preserve topological form. Comput. Aided Geom. Des. 12(8): 785-799 (1995) - [j12]Neil F. Stewart:
Science and Computer Science. ACM Comput. Surv. 27(1): 39-41 (1995) - 1993
- [j11]Neil F. Stewart:
Sufficient condition for correct topological form in tolerance specification. Comput. Aided Des. 25(1): 39-48 (1993) - [j10]Hélène Desaulniers, Neil F. Stewart:
Robustness of numerical methods in geometric computation when problem data is uncertain. Comput. Aided Des. 25(9): 539-545 (1993) - 1992
- [j9]Hélène Desaulniers, Neil F. Stewart:
An Extension of Manifold Boundary Representations to the r-Sets. ACM Trans. Graph. 11(1): 40-60 (1992) - 1991
- [j8]M. Boyer, Neil F. Stewart:
Modeling Spaces for Toleranced Objects. Int. J. Robotics Res. 10(5): 570-582 (1991)
1980 – 1989
- 1989
- [j7]F. Major, Jacques Malenfant, Neil F. Stewart:
Distance between objects represented by octtrees defined in different coordinate systems. Comput. Graph. 13(4): 497-503 (1989) - 1988
- [j6]Neil F. Stewart:
Computer communications for industrial automation: the MAP protocols. Comput. Commun. 11(5): 262-266 (1988) - [j5]G. Hurteau, Neil F. Stewart:
Distance calculation for imminent collision indication in a robot System simulation. Robotica 6(1): 47-51 (1988) - 1987
- [j4]A. Foisy, P. Jacques, Neil F. Stewart:
A robotic interface permitting error recovery. Robotics 3(3-4): 353-359 (1987) - [j3]Li-de Yu, Neil F. Stewart:
Distance estimation in a system with a mobile camera. Robotica 5(3): 197-200 (1987) - 1982
- [j2]Neil F. Stewart:
Data structures for virtual-circuit implementation. Comput. Commun. 5(4): 196-201 (1982)
1970 – 1979
- 1974
- [j1]Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart:
Cost-minimal trees in directed acyclic graphs. Z. Oper. Research 18(1): 59-67 (1974)
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-04-24 22:47 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:
