default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Scherfenberg
Person information
- affiliation: FU Berlin, Institute of Computer Science
- affiliation: Bayreuth University, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
[b1]Marc Scherfenberg:
Searching point patterns, matching imprecise point patterns, and inducing polygons. Free University of Berlin, 2011, pp. 1-156
Journal Articles
- 2013
- [j6]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On inducing polygons and related problems. Comput. Geom. 46(7): 861-878 (2013) - 2012
- [j5]Hee-Kap Ahn
, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete FRéChet Distance with Imprecise Input. Int. J. Comput. Geom. Appl. 22(1): 27-44 (2012) - 2011
- [j4]Ludmila Scharf, Marc Scherfenberg:
Inducing Polygons of Line Arrangements. Int. J. Comput. Geom. Appl. 21(3): 351-368 (2011) - [j3]Christian Knauer, Marc Scherfenberg:
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. Int. J. Comput. Geom. Appl. 21(3): 369-381 (2011) - [j2]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon. Am. Math. Mon. 118(2): 164-167 (2011) - [j1]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. Theor. Comput. Sci. 412(32): 4173-4186 (2011)
Conference and Workshop Papers
- 2010
- [c5]Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) 2010: 422-433 - 2009
- [c4]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On Inducing Polygons and Related Problems. ESA 2009: 47-58 - [c3]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The Directed Hausdorff Distance between Imprecise Point Sets. ISAAC 2009: 720-729 - 2008
- [c2]Ludmila Scharf, Marc Scherfenberg:
Inducing Polygons of Line Arrangements. ISAAC 2008: 507-519 - [c1]Christian Knauer, Marc Scherfenberg:
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. ISAAC 2008: 532-543
Informal and Other Publications
- 2009
- [i1]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. CoRR abs/0909.4642 (2009)
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-24 22: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:
