default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulien Basch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j6]Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang:
Kinetic collision detection between two simple polygons. Comput. Geom. 27(3): 211-235 (2004)- 2003
- [j5]Julien Basch, Leonidas J. Guibas, G. D. Ramkumar:
Reporting Red - Blue Intersections between Two Sets of Connected Line Segments. Algorithmica 35(1): 1-20 (2003) - [j4]Julien Basch, Harish Devarajan, Piotr Indyk, Li Zhang:
Probabilistic Analysis for Discrete Attributes of Moving Points. Int. J. Comput. Geom. Appl. 13(1): 5-22 (2003) - 2002
- [j3]Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang:
Deformable Free-Space Tilings for Kinetic Collision Detection. Int. J. Robotics Res. 21(3): 179-198 (2002) - 2001
- [c10]Julien Basch, Leonidas J. Guibas, David Hsu, An Thai Nguyen:
Disconnection Proofs for Motion Planning. ICRA 2001: 1765-1772 - 2000
- [j2]Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. Discret. Comput. Geom. 24(4): 721-733 (2000)
1990 – 1999
- 1999
- [b1]Julien Basch:
Kinetic data structures. Stanford University, USA, 1999 - [j1]Julien Basch, Leonidas J. Guibas, John Hershberger:
Data Structures for Mobile Data. J. Algorithms 31(1): 1-28 (1999) - [c9]Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. SCG 1999: 247-254 - [c8]Julien Basch, João Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang:
Kinetic Data Structures: Animating Proofs Through Time. SCG 1999: 427-428 - [c7]Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang:
Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111 - 1997
- [c6]Julien Basch, Leonidas J. Guibas, Li Zhang:
Proximity Problems on Moving Points. SCG 1997: 344-351 - [c5]Julien Basch, Leonidas J. Guibas, Craig Silverstein, Li Zhang:
A Practical Evaluation of Kinetic Data Structures. SCG 1997: 388-390 - [c4]Li Zhang, Harish Devarajan, Julien Basch, Piotr Indyk:
Probabilistic Analysis for Combinatorial Functions of Moving Points. SCG 1997: 442-444 - [c3]Julien Basch, Leonidas J. Guibas, G. D. Ramkumar:
Sweeping Lines and Line Segments with a Heap. SCG 1997: 469-471 - [c2]Julien Basch, Leonidas J. Guibas, John Hershberger:
Data Structures for Mobile Data. SODA 1997: 747-756 - 1996
- [c1]Julien Basch, Leonidas J. Guibas, G. D. Ramkumar:
Reporting Red-Blue Intersections between Two Sets of Connected Line Segments. ESA 1996: 302-319
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-06-10 21:21 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:
