default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Michel Moreau
Person information
- affiliation: LIRS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j6]Marco Aurelio Portela-Sotelo, Elodie Desserée, Jean-Michel Moreau, Behzad Shariat, Michael Beuve
:
3-D Model-Based Multiple-Object Video Tracking for Treatment Room Supervision. IEEE Trans. Biomed. Eng. 59(2): 562-570 (2012)- [c11]Xavier Faure, Florence Zara, Fabrice Jaillet, Jean-Michel Moreau:
An Implicit Tensor-Mass Solver on the GPU for Soft Bodies Simulation. VRIPHYS 2012: 1-10 - 2010
- [c10]Jacques Saadé, Anne-Laure Didier, Romain Buttin, Jean-Michel Moreau, Michael Beuve, Behzad Shariat, Pierre-Frédéric Villard:
A Preliminary Study for a Biomechanical Model of the Respiratory System. VISAPP (1) 2010: 509-515
2000 – 2009
- 2008
- [c9]Dominique Michelucci, Jean-Michel Moreau, Sebti Foufou:
Robustness and Randomness. Reliable Implementation of Real Number Algorithms 2008: 127-148 - 2006
- [i1]Dominique Michelucci, Jean-Michel Moreau, Sebti Foufou:
Robustness and Randomness. Reliable Implementation of Real Number Algorithms 2006 - 2004
- [j5]Luc Devroye, Christophe Lemaire, Jean-Michel Moreau:
Expected time analysis for Delaunay point location. Comput. Geom. 29(2): 61-89 (2004) - 2000
- [j4]Christophe Lemaire, Jean-Michel Moreau:
A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case. Comput. Geom. 17(1-2): 69-96 (2000) - [c8]Dominique Michelucci, Jean-Michel Moreau:
ZEA - A zero-free exact arithmetic . CCCG 2000
1990 – 1999
- 1999
- [c7]Hélymar Balza-Gomez, Dominique Michelucci, Jean-Michel Moreau:
The periodicity of integral convex hulls for conics in r2. CCCG 1999 - [c6]Luc Devroye, Christophe Lemaire, Jean-Michel Moreau:
Fast delaunay point location with search structures. CCCG 1999 - [c5]Hélymar Balza-Gomez, Jean-Michel Moreau, Dominique Michelucci:
Convex Hull of Grid Points below a Line or a Convex Curve. DGCI 1999: 361-374 - 1997
- [j3]Dominique Michelucci, Jean-Michel Moreau:
Lazy Arithmetic. IEEE Trans. Computers 46(9): 961-975 (1997) - [c4]Christophe Lemaire, Jean-Michel Moreau:
Analysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sorting. CCCG 1997 - 1995
- [j2]Jean-Claude Bajard, Dominique Michelucci, Jean-Michel Moreau, Jean-Michel Muller:
Introduction to the Special Issue: "Real Numbers and Computers". J. Univers. Comput. Sci. 1(7): 436-438 (1995) - 1994
- [j1]Mohand Ourabah Benouamer, P. Jaillon, Dominique Michelucci, Jean-Michel Moreau:
Hashing lazy numbers. Computing 53(3-4): 205-217 (1994) - [c3]Jean-Michel Moreau:
Hierarchical Delaunay Triangulation. CCCG 1994: 165-170 - 1993
- [c2]Mohand Ourabah Benouamer, P. Jaillon, Dominique Michelucci, Jean-Michel Moreau:
A lazy exact arithmetic. IEEE Symposium on Computer Arithmetic 1993: 242-249 - [c1]Jean-Michel Moreau, Pascal Volino:
Constrained Delaunay Triangulation Revisited. CCCG 1993: 340-345 - 1990
- [b1]Jean-Michel Moreau:
Hiérarchisation et facettisation de la représentation par segments d'un graphe planaire. (Hierarchies and triangulations in planar straight-line graphs in the context of two-level precision arithmetic). École nationale supérieure des mines de Saint-Étienne, France, 1990
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-21 00:12 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:
