×

zbMATH — the first resource for mathematics

Vahrenhold, Jan

Compute Distance To:
Author ID: vahrenhold.jan Recent zbMATH articles by "Vahrenhold, Jan"
Published as: Vahrenhold, Jan; Vahrenhold, J.
External Links: MGP · Wikidata · GND
Documents Indexed: 26 Publications since 1999, including 2 Books

Publications by Year

Citations contained in zbMATH Open

13 Publications have been cited 34 times in 27 Documents Cited by Year
Space-efficient geometric divide-and-conquer algorithms. Zbl 1185.68772
Bose, Prosenjit; Maheshwari, Anil; Morin, Pat; Morrison, Jason; Smid, Michiel; Vahrenhold, Jan
8
2007
I/O-efficient dynamic planar point location. Zbl 1056.68062
Arge, Lars; Vahrenhold, Jan
5
2004
In-place algorithms for computing (Layers of) maxima. Zbl 1184.68558
Blunck, Henrik; Vahrenhold, Jan
5
2010
Line-segment intersection made in-place. Zbl 1131.68113
Vahrenhold, Jan
3
2007
Time responsive external data structures for moving points. Zbl 0997.68522
Agarwal, Pankaj K.; Arge, Lars; Vahrenhold, Jan
2
2001
Reporting intersecting pairs of convex polytopes in two and three dimensions. Zbl 1015.52009
Agarwal, Pankaj K.; de Berg, Mark; Har-Peled, Sariel; Overmars, Mark H.; Sharir, Micha; Vahrenhold, Jan
2
2002
Line-segment intersection made in-place. Zbl 1161.68820
Vahrenhold, Jan
2
2005
Resilient \(k\)-d trees: \(k\)-means in space revisited. Zbl 1251.68084
Gieseke, Fabian; Moruz, Gabriel; Vahrenhold, Jan
2
2012
I/O-efficiently pruning dense spanners. Zbl 1136.68460
Gudmundsson, Joachim; Vahrenhold, Jan
1
2005
Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case. Zbl 1291.65065
Scheffer, Christian; Vahrenhold, Jan
1
2014
Efficient bulk operations on dynamic \(R\)-trees. Zbl 0994.68054
Arge, L.; Hinrichs, K. H.; Vahrenhold, J.; Vitter, J. S.
1
2002
Planar point location for large data sets: to seek or not to seek. Zbl 1083.68141
Vahrenhold, Jan; Hinrichs, Klaus H.
1
2002
An in-place algorithm for Klee’s measure problem in two dimensions. Zbl 1184.68573
Vahrenhold, Jan
1
2007
Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case. Zbl 1291.65065
Scheffer, Christian; Vahrenhold, Jan
1
2014
Resilient \(k\)-d trees: \(k\)-means in space revisited. Zbl 1251.68084
Gieseke, Fabian; Moruz, Gabriel; Vahrenhold, Jan
2
2012
In-place algorithms for computing (Layers of) maxima. Zbl 1184.68558
Blunck, Henrik; Vahrenhold, Jan
5
2010
Space-efficient geometric divide-and-conquer algorithms. Zbl 1185.68772
Bose, Prosenjit; Maheshwari, Anil; Morin, Pat; Morrison, Jason; Smid, Michiel; Vahrenhold, Jan
8
2007
Line-segment intersection made in-place. Zbl 1131.68113
Vahrenhold, Jan
3
2007
An in-place algorithm for Klee’s measure problem in two dimensions. Zbl 1184.68573
Vahrenhold, Jan
1
2007
Line-segment intersection made in-place. Zbl 1161.68820
Vahrenhold, Jan
2
2005
I/O-efficiently pruning dense spanners. Zbl 1136.68460
Gudmundsson, Joachim; Vahrenhold, Jan
1
2005
I/O-efficient dynamic planar point location. Zbl 1056.68062
Arge, Lars; Vahrenhold, Jan
5
2004
Reporting intersecting pairs of convex polytopes in two and three dimensions. Zbl 1015.52009
Agarwal, Pankaj K.; de Berg, Mark; Har-Peled, Sariel; Overmars, Mark H.; Sharir, Micha; Vahrenhold, Jan
2
2002
Efficient bulk operations on dynamic \(R\)-trees. Zbl 0994.68054
Arge, L.; Hinrichs, K. H.; Vahrenhold, J.; Vitter, J. S.
1
2002
Planar point location for large data sets: to seek or not to seek. Zbl 1083.68141
Vahrenhold, Jan; Hinrichs, Klaus H.
1
2002
Time responsive external data structures for moving points. Zbl 0997.68522
Agarwal, Pankaj K.; Arge, Lars; Vahrenhold, Jan
2
2001

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.