BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Events for LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20230602T140000
DTEND;TZID=Europe/Paris:20230602T160000
DTSTAMP:20230601T084645Z
CREATED:20230601T084645Z
LAST-MODIFIED:20230601T084645Z
UID:20252-1685714400-1685721600@www.loria.fr
SUMMARY:PhD Defense: Nuwan Herath (Gamble)
DESCRIPTION:Nuwan Herath (Gamble) will defend his thesis\, entitled “Fast high-resolution drawing of algebraic curves and surfaces”\, on Friday June 2nd at 2pm in room C005. \nAbstract:\nScientific visualization allows users to build an intuition and to get an understanding of their data. Its applications are numerous: modeling for simulations\, mechanism design\, medical imaging… We address the problem of visualizing implicit algebraic plane curves and surfaces\, that are solutions of a polynomial equation P(x\, y) = 0 or Q(x\, y\, z) = 0. More specifically\, we handle the problem of drawing high degree curves or surfaces at a high resolution. In this case\, most state-of-the-art approaches fail to produce drawings in a reasonable time due to the high evaluation cost of the polynomial.\nOur main contribution is to combine standard visualization algorithms from computer graphics with multipoint evaluation methods from computer algebra. More precisely\, we use the fast Discrete Cosine Transform (DCT)\, which can be computed efficiently with the Fast Fourier Transform (FFT) algorithm. In most of our algorithms\, we have combined that idea with a classical subdivision process in order to reduce the number of evaluations.\nUsing exact error bound computation and interval arithmetic\, we propose new algorithms which produce certified drawings. We compare them experimentally on two classes of high degree polynomials. Notably\, some of those approaches are faster than state-of-the-art drawing software. \nJury\nReviewers : \n\nStef Graillat\, Professor\, Sorbonne Université\, LIP6\nMichael Sagraloff\, Full Professor\, University of Applied Sciences Landshut · Computer Science\n\nExaminers : \n\nMarie-Odile Berger\, Senior Researcher\, INRIA Nancy\, Tangram Team\, Loria\nNathalie Revol\, Researcher\, INRIA Lyon\, LIP\, École Normale Supérieure de Lyon\n\nSupervisors :\n \n\nGuillaume Moroz\, Researcher\, INRIA Nancy\, Gamble Team\, Loria\nMarc Pouget\, Researcher\, INRIA Nancy\, Gamble Team\, Loria
URL:https://www.loria.fr/event/phd-defense-nuwan-herath-gamble/
LOCATION:Loria
CATEGORIES:Soutenance
END:VEVENT
END:VCALENDAR