Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark de Berg
- > Home > Persons > Mark de Berg
Publications
- 2011
[c92]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. SODA 2011: 285-296- 2010
- [j79]Mark de Berg, Otfried Cheong
, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. 43(4): 331-356 (2010) - [j77]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. 43(5): 493-513 (2010) - [j74]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. J. Comput. Geom. 1(1): 57-71 (2010) - 2009
- [j73]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009) - [j71]Mark de Berg, Herman J. Haverkort, Micha Streppel:
Efficient c-oriented range searching with DOP-trees. Comput. Geom. 42(3): 250-267 (2009) - [c80]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility maps of realistic terrains have linear smoothed complexity. SCG 2009: 163-168 - 2008
- [j65]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j60]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms 4(1): 9:1-9:30 (2008) - 2007
- [c69]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC 2007: 500-511 - [c67]Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
I/O-Efficient Flow Modeling on Fat Terrains. WADS 2007: 239-250 - [i3]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) - 2005
- [j55]Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff:
Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005) - [c58]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-oblivious r-trees. SCG 2005: 170-179 - [c55]Mark de Berg, Herman J. Haverkort, Micha Streppel:
Efficient c-Oriented Range Searching with DOP-Trees. ESA 2005: 508-519 - [c52]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron:
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - 2004
- [j51]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004) - [c49]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358 - [i1]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004 - 2003
- [c46]Mark de Berg, Herman J. Haverkort:
Significant-Presence Range Queries in Categorical Data. WADS 2003: 462-473 - 2002
- [j41]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. 28(3): 291-312 (2002) - [c45]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. SCG 2002: 53-62 - 2001
- [c42]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-trees and R-trees with near-optimal query time. SCG 2001: 124-133
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-04 22:42 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:
