default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJules Vleugels
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j10]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen
, Jules Vleugels:
Guarding scenes against invasive hypercubes. Comput. Geom. 26(2): 99-117 (2003)- 2002
- [j9]Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz:
Realistic Input Models for Geometric Algorithms. Algorithmica 34(1): 81-97 (2002) - [j8]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and motion planning. Comput. Geom. 23(1): 53-68 (2002) - [j7]Jules Vleugels, Remco C. Veltkamp:
Efficient image retrieval through vantage objects. Pattern Recognit. 35(1): 69-80 (2002)
1990 – 1999
- 1999
- [j6]Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels:
Motion Planning for Multiple Robots. Discret. Comput. Geom. 22(4): 505-525 (1999) - [c7]Jules Vleugels, Remco C. Veltkamp:
Efficient Image Retrieval through Vantage Objects. VISUAL 1999: 575-584 - 1998
- [j5]A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels:
Motion Planning in Environments with Low Obstacle Density. Discret. Comput. Geom. 20(4): 561-587 (1998) - [j4]Jules Vleugels, Mark H. Overmars:
Approximating Voronoi Diagrams of Convex Sites in any Dimension. Int. J. Comput. Geom. Appl. 8(2): 201-222 (1998) - [c6]Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels:
Motion Planning for Multiple Robots. SCG 1998: 374-382 - [c5]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and Motion Planning. SWAT 1998: 83-94 - [c4]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding Scenes against Invasive Hypercubes. WAE 1998: 110-120 - 1997
- [j3]Jules Vleugels, Joost N. Kok, Mark H. Overmars:
Motion Planning with Complete Knowledge Using a Colored Som. Int. J. Neural Syst. 8(5-6): 613-628 (1997) - [c3]Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels:
Realistic Input Models for Geometric Algorithms. SCG 1997: 294-303 - 1996
- [j2]Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao:
Hunting Voronoi Vertices. Comput. Geom. 6: 329-354 (1996) - [j1]Otfried Schwarzkopf, Jules Vleugels:
Range Searching in Low-Density Environments. Inf. Process. Lett. 60(3): 121-127 (1996) - 1995
- [c2]Petr Svestka, Jules Vleugels:
Exact Motion Planning for Tractor-Trailer Robots. ICRA 1995: 2445-2450 - 1994
- [c1]Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels:
Hunting Voronoi Vertices in Non-Polygonal Domains. CCCG 1994: 45-50
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-25 05:58 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:
