#### Filter Results:

#### Publication Year

1989

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
- CCCG
- 1997

Motivated by the problem of labeling maps, we i n vestigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follows. In On log n time, we can nd an Olog n-factor approximation of the maximum subset in a set of n arbitrary axis-parallel rectangles in the plane. If all rectangles have unit… (More)

- Marc J. van Kreveld, René van Oostrum, Chandrajit L. Bajaj, Valerio Pascucci, Daniel Schikore
- Symposium on Computational Geometry
- 1997

For 2D or 3D meshes that represent the domain of continuous function to the reals, the contours|or isosurfaces|of a speciied value are an important w ay to visualize the function. To nd such contours, a seed set can be used for the starting points from which the traversal of the contours can begin. This paper gives the rst methods to obtain seed sets that… (More)

- Christopher B. Jones, Ross Purves, +4 authors Robert Weibel
- SIGIR
- 2002

General Terms: add here 1. INTRODUCTION A large proportion of the resources available on the worldwide web refer to information that may be regarded as geographically located. Thus most activities and enterprises take place in one or more places on the Earth's surface and there is a wealth of survey data, images, maps and reports that relate to specific… (More)

Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in trajectories, namely flocks and meetings. The patterns are large enough subgroups of the moving point objects that exhibit similar movement and proximity for a certain amount of… (More)

- Boris Aronov, Kevin Buchin, +7 authors Bettina Speckmann
- J. Spatial Information Science
- 2011

Road network analysis can require distance from points that are not on the network themselves. We study the algorithmic problem of connecting a point inside a face (region) of the road network to its boundary while minimizing the detour factor of that point to any point on the boundary of the face. We show that the optimal single connection (feed-link) can… (More)

- Marc J. van Kreveld, Bettina Speckmann
- ESA
- 2004

A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangles is chosen such that their areas represent a geographic variable (e.g., population). Good rectangular cartograms are hard to generate: The area specifications for each rectangle may make it impossible to realize correct adjacencies between the regions and… (More)

- Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
- International Journal of Geographical Information…
- 1995

In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by performing a depth-rst search on the subdivision, using local criteria for deciding what is the next cell to visit. Our method is extremely simple and provably correct. The algorithm has… (More)

- Avi Arampatzis, Marc J. van Kreveld, +5 authors Mark Sanderson
- Computers, Environment and Urban Systems
- 2006

This paper describes several steps in the derivation of boundaries of imprecise regions using the Web as the information source. We discuss how to use the Web to obtain locations that are part of and locations that are not part of the region to be delineated, and then we propose methods to compute the region algorithmically. The methods introduced are… (More)

- Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld
- Comput. Geom.
- 2000