Остановите войну!
for scientists:
default search action
Sylvain Lazard
- > Home > Persons > Sylvain Lazard
Publications
- 2011
- [j30]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011) - 2010
- [j27]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. Discret. Comput. Geom. 43(2): 272-288 (2010) - [i7]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010) - 2009
- [j23]Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang:
On the degree of standard geometric predicates for line transversals in 3D. Comput. Geom. 42(5): 484-494 (2009) - [j22]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
On the complexity of umbra and penumbra. Comput. Geom. 42(8): 758-771 (2009) - [j21]Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din:
The Voronoi Diagram of Three Lines. Discret. Comput. Geom. 42(1): 94-130 (2009) - 2008
- [c24]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides:
On the Size of the 3D Visibility Skeleton: Experimental Results. ESA 2008: 805-816 - 2007
- [j15]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Parabola Separation Queries and their Application to Stone Throwing. Int. J. Comput. Geom. Appl. 17(4): 349-360 (2007) - [j14]Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang:
On the Expected Size of the 2D Visibility Complex. Int. J. Comput. Geom. Appl. 17(4): 361-381 (2007) - [j13]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007) - [c23]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides:
Towards an implementation of the 3D visibility skeleton. SCG 2007: 131-132 - [c22]Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din:
The voronoi diagram of three lines. SCG 2007: 255-264 - [c21]Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
Between umbra and penumbra. SCG 2007: 265-274 - [c20]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418 - [c19]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. GD 2007: 345-351 - 2006
- [j10]Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath:
Drawing Kn in Three Dimensions with One Bend per Edge. J. Graph Algorithms Appl. 10(2): 287-295 (2006) - [c18]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Throwing Stones Inside Simple Polygons . AAIM 2006: 185-193 - [c17]Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang:
Predicates for Line Transversals in 3D. CCCG 2006 - 2005
- [j9]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34(3): 381-390 (2005) - [c16]Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang:
An Experimental Assessment of the 2D Visibility Complex. CCCG 2005: 298-301 - [c15]Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath:
Drawing Kn in Three Dimensions with One Bend Per Edge. GD 2005: 83-88 - 2004
- [c13]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG 2004: 46-55 - 2003
- [j7]Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean:
The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003) - [c11]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to line segments in R3. CCCG 2003: 174-177 - [i5]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
The number of transversals to line segments in R^3. CoRR math.MG/0306401 (2003) - 2002
- [c9]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117 - 1998
- [c5]Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides:
Convexifying star-shaped polygons. CCCG 1998
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-01-04 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint