|
|
|
|
|
|
|
|
|
- Kinetic Data Structures
B. Speckmann.
Encyclopedia of Algorithms, M.-Y. Kao (editor), Springer Verlag, pp. 417-419, 2008.
- Computational Geometry: Fundamental Structures
M. de Berg and B. Speckmann.
D.P. Mehta and S. Sahni (eds.), Handbook of Data Structures and Applications, CRC Press, pp. 62.1–62.20, 2005.
|
|
|
- StenoMaps: Shorthand for shapes
A. van Goethem, A. Reimer, B. Speckmann, and J. Wood
IEEE Transactions on Visualization and Computer Graphics, 2014 (to appear).
(Proceedings VIS 2014)
- Angle-Restricted Steiner Arborescences for Flow Map Layout
K. Buchin, B. Speckmann, and K. Verbeek.
Algorithmica, 2014 (to appear).
- Treemaps with Bounded Aspect Ratio
Mark de Berg, B. Speckmann, and V. van der Weele.
Computational Geometry: Theory and Applications, 47(6):683–693, 2014.
(special issue of invited papers from the 27th European Workshop on Computational Geometry)
- Triangulating and Guarding Realistic Polygons
G. Aloupis, P. Bose, V. Dujmovic, C. Gray, S. Langerman, and B. Speckmann.
Computational Geometry: Theory and Applications, 47(2):296–306, 2014.
(special issue of invited papers from the 20th Canadian Conference on Computational Geometry)
- Plane Graphs with Parity Constraints
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, and B. Vogtenhuber.
Graphs and Combinatorics, 30(1):47–69, 2014.
- KelpFusion: a Hybrid Set Visualization Technique
W. Meulemans, N. Henry Riche, B. Speckmann, B. Alper, and T. Dwyer.
IEEE Transactions on Visualization and Computer Graphics, 19(11):1846–1858, 2013.
- Topologically Safe Curved Schematisation
A. van Goethem, W. Meulemans, A. Reimer, H. Haverkort, and B. Speckmann
The Cartographic Journal, 50(3):276–285, 2013.
(special issue of invited papers from the 26th International Cartographic Conference)
- Flip Graphs of Bounded Degree Triangulations
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz, and B. Speckmann.
Graphs and Combinatorics, 29(6):1577–1593, 2013.
- Maximizing Maximal Angles for Plane Straight Line Graphs
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Por, F. Santos, B. Speckmann, and B. Vogtenhuber.
Computational Geometry: Theory and Applications, 46(1):17–28, 2013.
- Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model
M. de Berg, M. Roeloffzen, and B. Speckmann.
Journal of Computational Geometry, 3(1):222–249, 2012.
- Shooting Permanent Rays among Disjoint Polygons in the Plane
M. Ishaque, B. Speckmann, and C.D. Tóth.
SIAM Journal on Computing, 41(4):1005–1027, 2012.
- Kelp Diagrams: Point Set Membership Visualization
K. Dinkla, M. van Kreveld, B. Speckmann, and M. Westenberg.
Computer Graphics Forum, 31(3):875–884, 2012.
(Proc. Eurographics / IEEE Symposium on Visualization (EuroVis) 2012)
- Area-Universal and Constrained Rectangular Layouts
D. Eppstein, E. Mumford, B. Speckmann, and K. Verbeek.
SIAM Journal on Computing, 41(3):537–564, 2012.
- Analysis and Visualization of Animal Movement
J. Shamoun-Baranes, E. van Loon, R. Purves, B. Speckmann, D. Weiskopf, and C. Camphuysen.
Biology Letters, 8(1):6–9, 2012.
- Connect the dot: Computing Feed-links for Network Extension
B. Aronov, K. Buchin, M. Buchin, B. Jansen, T. de Jong, M. van Kreveld, M. Löffler, J. Luo, R. I. Silveira, and B. Speckmann.
Journal of Spatial Information Science, 3:3–31, 2011.
- Empty Pseudo-Triangles in Point Sets
H. Ahn, S. Bae, M. van Kreveld, I. Reinbacher, and B. Speckmann.
Discrete Applied Mathematics, 159(18):2205–2213, 2011.
- Flow Map Layout via Spiral Trees
K. Verbeek, K. Buchin, and B. Speckmann.
IEEE Transactions on Visualization and Computer Graphics, 17(12):2536–2544, 2011.
(Proceedings Visualization / Information Visualization 2011)
- On Planar Support for Hypergraphs
K. Buchin, M. van Kreveld, H. Meijer, B. Speckmann, and K. Verbeek.
Journal of Graph Algorithms and Applications, 15(4): 533–549, 2011.
- Geometric Simultaneous Embeddings of a Graph and a Matching
S. Cabello, M. van Kreveld, G. Liotta, H. Meijer, B. Speckmann, and K. Verbeek.
Journal of Graph Algorithms and Applications, 15(1): 79–96, 2011.
(special issue of invited papers from the 17th International Symposium on Graph Drawing)
- Necklace Maps
B. Speckmann and K. Verbeek.
IEEE Transactions on Visualization and Computer Graphics, 16(6):881–889, 2010.
(Proceedings Visualization / Information Visualization 2010)
Best Paper Honorable Mention
One of our maps is featured on the cover of the proceedings.
- Algorithmic Aspects of Proportional Symbol Maps
S. Cabello, H. Haverkort, M. van Kreveld, and B. Speckmann.
Algorithmica, 58(3):543–565, 2010.
- Finding the Most Relevant Fragments in Networks
K. Buchin, S. Cabello, J. Gudmundsson, M. Löffler, J. Luo, G. Rote, R. I. Silveira, B. Speckmann, and T. Wolle.
Journal of Graph Algorithms and Application 14(2):307–336, 2010.
- Optimal BSPs and Rectilinear Cartograms
M. de Berg, E. Mumford, and B. Speckmann.
International Journal of Computational Geometry and Applications 20(2):203–222, 2010.
- Pointed Binary Encompassing Trees: Simple and Optimal
M. Hoffmann, B. Speckmann, and C.D. Tóth.
Computational Geometry: Theory and Applications, 43(1):35–41, 2010.
(special issue of invited papers from the 14th Annual Fall Workshop on Computational Geometry)
- Matched Drawings of Planar Graphs
E. Di Giacomo, W. Didimo, M. van Kreveld, G. Liotta, and B. Speckmann.
Journal of Graph Algorithms and Applications 13(3):423–445, 2009.
(special issue of invited papers from the 15th International Symposium on Graph Drawing)
- Kinetic kd-Trees and Longest-Side kd-Trees
M.A. Abam, M. de Berg, and B. Speckmann.
SIAM Journal on Computing, 39(4):1219–1232, 2009.
- Polychromatic Colorings of Plane Graphs
N. Alon, R. Berke, K. Buchin, M. Buchin, P. Csorba, S. Shannigrahi, B. Speckmann, and P. Zumstein.
Discrete and Computational Geometry, 42(3):421–442, 2009.
(special issue of invited papers from the 24th ACM Symposium on Computational Geometry)
- Edges and Switches, Tunnels and Bridges
D. Eppstein, M. van Kreveld, E. Mumford, and B. Speckmann.
Computational Geometry: Theory and Applications, 42(8):790–802, 2009.
(special issue of invited papers from the 23rd European Workshop on Computational Geometry)
- On Minimum Weight Pseudo-Triangulations
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann.
Computational Geometry: Theory and Applications, 42(6-7):627–631, 2009.
- Kinetic Collision Detection for Convex Fat Objects
M.A. Abam, M. de Berg, S.-H. Poon, and B. Speckmann.
Algorithmica, 53(4):457–473, 2009.
(special issue of invited papers from the 14th European Symposium on Algorithms)
- On Rectilinear Duals for Vertex-Weighted Plane Graphs
M. de Berg, E. Mumford, and B. Speckmann.
Discrete Mathematics, 309(7):1794–1812, 2009.
(special issue of invited papers from the 13th International Symposium on Graph Drawing)
- Efficient Algorithms for Maximum Regression Depth
M. van Kreveld, J.S.B. Mitchell, P. Rousseeuw, M. Sharir, J. Snoeyink, and B. Speckmann.
Discrete and Computational Geometry, 39(4):656–677, 2008.
Java
Demo Computing maximum regression depth
- On the Number of Pseudo-Triangulations of Certain Point Sets
O. Aichholzer, D. Orden, F. Santos, and B. Speckmann.
Journal of Combinatorial Theory, Series A, 115(2):254–278, 2008.
- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
O. Aichholzer, C. Huemer, S. Renkl, B. Speckmann, and C.D. Tóth.
Graphs and Combinatorics, 23(5):481–507, 2007.
- Efficient Detection of Patterns in 2D Trajectories of Moving Points
J. Gudmundsson, M. van Kreveld, and B. Speckmann.
Geoinformatica, 11(2):195–215, 2007.
- On Rectangular Cartograms
M. van Kreveld and B. Speckmann.
Computational Geometry: Theory and Applications, 37(3):175–187, 2007.
(special issue of invited papers from the 20th European Workshop on Computational Geometry)
- Area-Preserving Approximations of Polygonal Paths
P. Bose, S. Cabello, O. Cheong, J. Gudmundsson, M. van Kreveld, and B. Speckmann.
Journal of Discrete Algorithms, 4(4):554–566, 2006.
- Allocating Vertex pi-guards in Simple Polygons via Pseudo-Triangulations
B. Speckmann and C.D. Tóth.
Discrete and Computational Geometry, 33(2):345–364, 2005.
- Convexity Minimizes
Pseudo-Triangulations
O. Aichholzer, F. Aurenhammer, H. Krasser, and B. Speckmann.
Computational Geometry: Theory and Applications,
28(1): 3–10, 2004.
(special issue of invited papers from the 14th Canadian
Conference on Computational Geometry)
- Tight Degree
Bounds for Pseudo-Triangulations of Points
L. Kettner, D. Kirkpatrick, A. Mantler, J. Snoeyink, B.
Speckmann, and F. Takeuchi.
Computational Geometry: Theory and Applications,
25(1&2):1–12, 2003.
(special issue of invited papers from the 17th European
Workshop on Computational Geometry)
- Kinetic Collision Detection
for Simple Polygons
D. Kirkpatrick, J. Snoeyink, and B. Speckmann.
International Journal of Computational Geometry and Applications,
12(1-2):3–27, 2002.
(special issue of invited papers from the 16th ACM Symposium
on Computational Geometry)
Java
Demo Kinetic collision
detection for simple polygons
- Easy Triangle Strips
for TIN Terrain Models
B. Speckmann and J. Snoeyink.
International Journal of Geographical Information Science,
15(4):379–386, 2001.
|
|
|
- Column Planarity and Partial Simultaneous Geometric Embedding
W. Evans, V. Kusters, M. Saumell, and B. Speckmann
Proc.
22nd International Symposium on Graph Drawing (GD 14), 2014 (to appear).
- Map Schematization with Circular Arcs
T. van Dijk, A. van Goethem, J.-H. Haunert, W. Meulemans, and B. Speckmann
Proc. 8th International Conference on Geographic Information Science (GIScience), 2014 (to appear).
- Linear Cartograms with Fixed Vertex Locations
K. Buchin, A. van Goethem, M. Hoffmann, M. van Kreveld, and B. Speckmann
Proc. 8th International Conference on Geographic Information Science (GIScience), 2014 (to appear).
- Computing the Fréchet distance with shortcuts is NP-hard
|
M. Buchin, A. Driemel, and B. Speckmann
Proc. 30th ACM Symposium
on Computational Geometry (SoCG), pp. 367– 376, 2014. |
- Exploring Curved Schematization
A. van Goethem, W. Meulemans, B. Speckmann and J. Wood
Proc. 7th IEEE Pacific Visualization Symposium (PacificVis), pp. 1–8, 2014.
Best Paper Award
- GlamMap: Visualizing Library Metadata
A. Betti, D. Gerrits, B. Speckmann, and H. van den Berg
Proc. 17th VALA Biennial Conference, 2014.
- Accentuating Focus Maps via Partial Schematization
|
|
T. van Dijk, A. van Goethem, J.-H. Haunert, W. Meulemans, and B. Speckmann.
Proc. 21th International Conference on Advances in Geographic Information Systems (ACM GIS), pp. 418–421, 2013.
Best Poster Award Runner Up |
- Colored Spanning Graphs for Set Visualization
F. Hurtado, M. Korman, M. van Kreveld, M. Löffler, V. Sacristán, R. I. Silveira, and B. Speckmann.
Proc.
21st International Symposium on Graph Drawing (GD 13), pp. 280–291, Lecture Notes in Computer Science 8242, 2013.
- Strict Confluent Drawing
D. Eppstein, D. Holten, M. Löffler, M. Nöllenburg, B. Speckmann, and K. Verbeek.
Proc.
21st International Symposium on Graph Drawing (GD 13), pp. 352–363, Lecture Notes in Computer Science 8242, 2013.
- Convex-Arc Drawings of Pseudolines
|
D. Eppstein, M. van Garderen, B. Speckmann, and T. Ueckerdt.
Proc.
21st International Symposium on Graph Drawing (GD 13), pp. 522–523, Lecture Notes in Computer Science 8242, 2013. |
- Distance-Sensitive Planar Point Location
B. Aronov, M. de Berg, M. Roeloffzen, and B. Speckmann.
Proc. 13th Algorithms and Data Structures Symposium (WADS), pp. 49–60, Lecture Notes in Computer Science 8037, 2013.
- Trajectory Grouping Structure
K. Buchin, M. Buchin, M. van Kreveld, B. Speckmann, and F. Staals.
Proc. 13th Algorithms and Data Structures Symposium (WADS), pp. 219–230, Lecture Notes in Computer Science 8037, 2013.
- Kinetic 2-centers in the Black-Box Model
|
M. de Berg, M. Roeloffzen, and B. Speckmann.
Proc. 29th ACM Symposium
on Computational Geometry (SoCG), pp. 145–154, 2013. |
- Improved Grid Map Layout by Point Set Matching
D. Eppstein, M. van Kreveld, B. Speckmann, and F. Staals.
Proc. 6th IEEE Pacific Visualization Symposium (PacificVis), pp. 25–32, 2013.
- Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes
M. de Berg, M. Roeloffzen, and B. Speckmann.
Proc.
20th European Symposium on Algorithms (ESA), pp. 383–394, Lecture Notes in Computer Science 7501, 2012.
- Locally Correct Fréchet Matchings
K. Buchin, M. Buchin, W. Meulemans, and B. Speckmann.
Proc. 20th European Symposium on Algorithms (ESA), pp. 229–240, Lecture Notes in Computer Science 7501, 2012.
- Context-Aware Similarity of Trajectories
M. Buchin, S. Dodge, and B. Speckmann.
Proc. 7th International Conference on Geographic Information Science (GIScience), pp. 43–56, Lecture Notes in Computer Science 7478, 2012.
- Evolution Strategies for Optimizing Rectangular Cartograms
K. Buchin, B. Speckmann, and S. Verdonschot.
Proc. 7th International Conference on Geographic Information Science (GIScience), pp. 29–42, Lecture Notes in Computer Science 7478, 2012.
- Angle-Restricted Steiner Arborescences for Flow Map Layout
K. Buchin, B. Speckmann, and K. Verbeek.
Proc. 22nd International
Symposium on Algorithms and Computation (ISAAC), pp. 250–259, Lecture Notes in Computer Science 7074, 2011.
- Treemaps with Bounded Aspect Ratio
M. de Berg, B. Speckmann, and V. van der Weele.
Proc. 22nd International
Symposium on Algorithms and Computation (ISAAC), pp. 260–270, Lecture Notes in Computer Science 7074, 2011.
- A Splitting Line Model for Directional Relations
|
K. Buchin, V. Kusters, B. Speckmann, F. Staals, and B. Vasilescu.
Proc. 19th International Conference on Advances in Geographic Information Systems (ACM GIS), pp. 142–151, 2011. |
- A New Method for Subdivision Simplification with Applications to Urban-Area Generalization
|
K. Buchin, W. Meulemans, and B. Speckmann.
Proc. 19th International Conference on Advances in Geographic Information Systems (ACM GIS), pp. 261–270, 2011. |
- Delineating Imprecise Regions via Shortest-Path Graphs
|
M. de Berg, W. Meulemans, and B. Speckmann.
Proc. 19th International Conference on Advances in Geographic Information Systems (ACM GIS), pp. 271–280, 2011. |
- Kinetic Convex Hulls and Delaunay Triangulations in the Black-Box Model
|
M. de Berg, M. Roeloffzen, and B. Speckmann.
Proc. 27th ACM Symposium
on Computational Geometry (SoCG), pp. 244–253, 2011. |
- Optimizing Regular Edge Labelings
K. Buchin, B. Speckmann, and S. Verdonschot.
Proc. 18th International Symposium on Graph Drawing (GD 10), pp. 117–128, Lecture Notes in Computer Science 6502, 2011.
- Area-Preserving Subdivision Schematization
W. Meulemans, A. van Renssen, and B. Speckmann.
Proc.
6th International Conference on Geographic Information Science (GIScience), pp. 160–174, Lecture Notes in Computer Science 6292, 2010.
- Homotopic Rectilinear Routing with Few Links and Thick Edges
B. Speckmann and K. Verbeek.
Proc.
9th Latin American Theoretical Informatics Symposium (LATIN), pp. 468–479, Lecture Notes in Computer Science 6034, 2010.
- Geometric Simultaneous Embeddings of a Graph and a Matching
S. Cabello, M. van Kreveld, G. Liotta, H. Meijer, B. Speckmann, and K. Verbeek.
Proc. 17th International Symposium on Graph Drawing (GD 09), pp. 183–194, Lecture Notes in Computer Science 5849, 2010.
- On Planar Supports for Hypergraphs
K. Buchin, M. van Kreveld, H. Meijer, B. Speckmann, and K. Verbeek.
Proc. 17th International Symposium on Graph Drawing (GD 09), pp. 345–356, Lecture Notes in Computer Science 5849, 2010.
- Flip Graphs of Bounded-Degree Triangulations
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz, and B. Speckmann.
Proc. European Conference on Combinatorics, Graph Theory and Applications (EuroComb), pp. 509–513, Electronic Notes in Discrete Mathematics 34, 2009.
- Connect the Dot: Computing Feed-links with Minimum Dilation
B. Aronov, K. Buchin, M. Buchin, M. van Kreveld, M. Löffler, J. Luo, R. I. Silveira, and B. Speckmann.
Proc. 11th Algorithms and Data Structures Symposium (WADS), pp. 49–60, Lecture Notes in Computer Science 5664, 2009.
- Plane Graphs with Parity Constraints
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, and B. Vogtenhuber.
Proc. 11th Algorithms and Data Structures Symposium (WADS), pp. 13 –24, Lecture Notes in Computer Science 5664, 2009.
- Area-Universal Rectangular Layouts
|
D. Eppstein, E. Mumford, B. Speckmann, and K. Verbeek.
Proc. 25th ACM Symposium
on Computational Geometry (SoCG), pp. 267–276, 2009. |
- Shooting Permanent Rays among Disjoint Polygons in the Plane
|
M. Ishaque, B. Speckmann, and C.D. Tóth.
Proc. 25th ACM Symposium
on Computational Geometry (SoCG), pp. 51–60, 2009. |
- Detecting Hotspots in Geographic Networks
K. Buchin, S. Cabello, J. Gudmundsson, M. Löffler, J. Luo, G. Rote, R. I. Silveira, B. Speckmann, and T. Wolle.
Advances in GIScience, Proc. 12th AGILE International Conference on Geographic Information Science (AGILE), pp. 217–231, Lecture Notes in Geoinformation and Cartography, 2009.
Best Paper
- Subdivision Drawings of Hypergraphs
M. Kaufmann, M. van Kreveld, and B. Speckmann.
Proc. 16th International Symposium on Graph Drawing (GD 08), pp. 396–407, Lecture Notes in Computer Science 5417, 2009.
- Feed-links for Network Extensions
|
B. Aronov, K. Buchin, M. Buchin, B. Jansen, T. de Jong, M. van Kreveld, M. Löffler, J. Luo, R. I. Silveira, and B. Speckmann.
Proc. 16th International Conference on Advances in Geographic Information Systems (ACM GIS), pp. 308–316, 2008. |
- Polychromatic Colorings of Plane Graphs
|
N. Alon, R. Berke, K. Buchin, M. Buchin, P. Csorba, S. Shannigrahi, B. Speckmann, and P. Zumstein.
Proc. 24th ACM Symposium
on Computational Geometry (SoCG), pp. 338–345, 2008. |
- Matched Drawings of Planar Graphs
E. Di Giacomo, W. Didimo, M. van Kreveld, G. Liotta, and B. Speckmann.
Proc. 15th International Symposium on Graph Drawing (GD 07), pp. 183–194, Lecture Notes in Computer Science 4875, 2008.
- Edges and Switches, Tunnels and Bridges
D. Eppstein, M. van Kreveld, E. Mumford, and B. Speckmann.
Proc. 10th Workshop on Algorithms and Data
Structures (WADS), pp. 77–88, Lecture Notes in Computer Science 4619, 2007.
- Maximizing Maximal Angles for Plane Straight Line Graphs
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Por, F. Santos, B. Speckmann, and B. Vogtenhuber.
Proc. 10th Workshop on Algorithms and Data
Structures (WADS), pp. 458–469, Lecture Notes in Computer Science 4619, 2007.
- Kinetic kd-Trees and Longest-Side kd-Trees
|
M.A. Abam, M. de Berg, and B. Speckmann.
Proc. 23rd ACM Symposium
on Computational Geometry (SoCG), pp. 364–372, 2007. |
- Optimal BSPs and Rectilinear Cartograms
|
M. de Berg, E. Mumford, and B. Speckmann.
Proc. 14th International Symposium on Advances in Geographic Information Systems (ACM GIS), pp. 19–26, 2006. |
- Kinetic Collision Detection for Convex Fat Objects
M.A. Abam, M. de Berg, S.-H. Poon, and B. Speckmann.
Proc. 14th European Symposium on Algorithms (ESA), pp. 4–15, Lecture Notes in Computer Science
4168, 2006.
- Algorithmic Aspects of Proportional Symbol Maps
S. Cabello, H. Haverkort, M. van Kreveld, and B. Speckmann.
Proc. 14th European Symposium on Algorithms (ESA), pp. 720–731, Lecture Notes in Computer Science
4168, 2006.
- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
O. Aichholzer, C. Huemer, S. Renkl, B. Speckmann, and C.D. Tóth.
Proc. 31st International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 86–97, Lecture Notes in Computer Science
4162, 2006.
- A Linear Programming Approach to Rectangular Cartograms
B. Speckmann, M. van Kreveld, and S. Florisson.
Progress in Spatial Data Handling, Proc. 12th International Symposium on Spatial Data Handling (SDH), pp. 527–546, 2006.
Webpage Rectangular Cartograms
- On Rectilinear Duals for Vertex-Weighted Plane Graphs
M. de Berg, E. Mumford, and B. Speckmann.
Proc. 13th International Symposium on Graph Drawing (GD 05), pp. 61–72, Lecture Notes in Computer Science 3843, 2006.
- Rectangular Cartogram Computation with Sea Regions
M. van Kreveld and B. Speckmann.
Proc. 22nd International Cartographic Conference (ICC), 2005.
- Off-line Admission Control for Advance Reservations in Star Networks
U. Adamy, T. Erlebach, D. Mitsche, I. Schurr, B. Speckmann, and E. Welzl.
Proc. 2nd Workshop on Approximation and Online Algorithms (WAOA), pp. 211–224, Lecture Notes in Computer Science 3351, 2005.
- Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets
|
J. Gudmundsson, M. van Kreveld, and B. Speckmann.
Proc. 12th International Symposium on Advances in Geographic Information Systems (ACM GIS), pp. 250–257, 2004. |
- On Rectangular Cartograms
M. van Kreveld and B. Speckmann.
Proc. 12th European Symposium on Algorithms (ESA), pp. 724–735, Lecture Notes in Computer Science 3221, 2004.
- Bounds on the k-Neighborhood for Locally Uniform Sampled
Surfaces
M. Andersson, J. Giesen, M. Pauly, and B. Speckmann.
Proc. 1st Symposium on Point-Based Graphics, pp.
167–171 plus color page 233, 2004.
- Pointed
Binary Encompassing Trees
M. Hoffmann, B. Speckmann, and C.D. Tóth.
Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT), pp. 442–454, Lecture Notes in Computer Science 3111, 2004.
- The Zigzag Path of a
Pseudo-Triangulation
O. Aichholzer, G. Rote, B. Speckmann, and I. Streinu
Proc. 8th Workshop on Algorithms and Data
Structures (WADS), pp. 377–388, Lecture Notes in Computer
Science 2748, 2003.
- Allocating Vertex pi-guards in Simple Polygons via Pseudo-Triangulations
B. Speckmann and C.D. Tóth.
Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 109–118, 2003.
- Cutting a Country
for Smallest Square Fit
M. van Kreveld and B. Speckmann.
Proc. 13th International
Symposium on Algorithms and Computation (ISAAC), Lecture
Notes in Computer Science 2518, pp. 91–102,
2002.
- Kinetic Maintenance of
Context-Sensitive Hierarchical Representations for Disjoint
Simple Polygons
|
D. Kirkpatrick and B. Speckmann.
Proc. 18th ACM Symposium
on Computational Geometry (SoCG), pp. 179–188, 2002. |
- Separation Sensitive
Kinetic Separation Structures for Convex Polygons
D. Kirkpatrick and B. Speckmann.
Proc. Japan Conference on Discrete and Computational
Geometry (JCDCG), Lecture Notes in Computer Science
2098, pp. 222–236, 2001.
- Kinetic Collision Detection
for Simple Polygons
|
D. Kirkpatrick, J. Snoeyink, and B. Speckmann.
Proc. 16th ACM Symposium on Computational Geometry (SoCG),
pp. 322–330, 2000. |
Java
Demo Kinetic collision
detection for simple polygons
- Efficient Algorithms
for Maximum Regression Depth
|
M. van Kreveld, J.S.B. Mitchell, P. Rousseeuw, M. Sharir,
J. Snoeyink, and B. Speckmann.
Proc. 15th ACM Symposium on Computational Geometry (SoCG), pp. 31–40, 1999. |
Java
Demo Computing maximum regression depth
| |
|
- Rectangular Cartograms: the Game
M. de Berg, F. van Nijnatten, B. Speckmann, and K. Verbeek.
18th Annual Multimedia Review of Computational Geometry, Proc. 25th ACM Symposium on Computational Geometry, pp. 96–97, 2009.
Webpage Rectangular cartograms: the game
- Rectangular Cartograms: Construction & Animation
S. Florisson, M. van Kreveld, and B. Speckmann.
14th Annual Multimedia Review of Computational Geometry, Proc. 21st ACM Symposium on Computational Geometry, pp. 372–373, 2005.
|
|
|
- An Automated Method for Circular-Arc Metro Maps
T. van Dijk, A. van Goethem, J.-H. Haunert, W. Meulemans, and B. Speckmann.
Abstr.
Schematic Mapping Workshop, 2014 (to appear).
- Distance-Sensitive Point Location Made Easy
B. Aronov, M. De Berg, D. Eppstein, M. Roeloffzen, and B. Speckmann.
Abstr. 30th European Workshop on Computational Geometry (EuroCG), 2014 (to appear).
- Sea Regions for Rectangular Cartograms
K. Buchin, R. Cano, P. J. de Rezende, C. de Souza, and B. Speckmann.
Abstr. 30th European Workshop on Computational Geometry (EuroCG), 2014 (to appear).
- Computing the Fréchet Distance with Shortcuts is NP-Hard
M. Buchin, A. Driemel, and B. Speckmann.
Abstr. 29th European Workshop on Computational Geometry (EuroCG), pp. 43–46, 2013.
- Topologically Safe Curved Schematization
A. van Goethem, H. Haverkort, W. Meulemans, A. Reimer, and B. Speckmann.
Abstr. 29th European Workshop on Computational Geometry (EuroCG), pp. 87–90, 2013.
- Kinetic Euclidean 2-Centers in the Black-Box Model
M. de Berg, M. Roeloffzen, and B. Speckmann.
Abstr. 29th European Workshop on Computational Geometry (EuroCG), pp. 173–176, 2013.
- Kinetic Collision Detection for Low-Density Scenes in the Black-Box Model
M. de Berg, M. Roeloffzen and B. Speckmann.
Abstr. 28th European Workshop on Computational Geometry (EuroCG), pp. 53–56, 2012.
- Locally Correct Fréchet Matchings
K. Buchin, M. Buchin, W. Meulemans, and B. Speckmann.
Abstr. 28th European Workshop on Computational Geometry (EuroCG), pp. 81–84, 2012.
- One-to-one Point Set Matchings for Grid Map Layout
D. Eppstein, M. van Kreveld, B. Speckmann, and F. Staals.
Abstr. 28th European Workshop on Computational Geometry (EuroCG), pp. 205–208, 2012.
- The 2x2 Simple Packing Problem
A. van Renssen and B. Speckmann.
Proc. 23rd Canadian Conference on Computational Geometry (CCCG), pp. 387–392, 2011.
- Angle-Restricted Steiner Arborescences for Flow Map Layout
K. Buchin, B. Speckmann, and K. Verbeek.
Abstr. 27th European Workshop on Computational Geometry (EuroCG), pp. 35–38, 2011.
- Convex Treemaps with Bounded Aspect Ratio
M. de Berg, B. Speckmann, and V. van der Weele.
Abstr. 27th European Workshop on Computational Geometry (EuroCG), pp. 71–74, 2011.
- Area-Preserving C-Oriented Schematization
K. Buchin, W. Meulemans, and B. Speckmann.
Abstr. 27th European Workshop on Computational Geometry (EuroCG), pp. 163–166, 2011.
- Kinetic Convex Hulls in the Black-Box Model
M. de Berg, M. Roeloffzen, and B. Speckmann.
Abstr. 27th European Workshop on Computational Geometry (EuroCG), pp. 201–204, 2011.
- Homotopic Rectilinear Routing with Few Links and Thick Edges
B. Speckmann and K. Verbeek.
Abstr. 25th European Workshop on Computational Geometry (EuroCG), pp. 243–246, 2009.
- Area-Universal Rectangular Layouts
D. Eppstein, E. Mumford, B. Speckmann, and K. Verbeek.
Abstr. 25th European Workshop on Computational Geometry (EuroCG), pp. 247–250, 2009.
- Triangulating and Guarding Realistic Polygons
G. Aloupis, P. Bose, V. Dujmovic, C. Gray, S. Langerman, and B. Speckmann.
Proc. 20th Canadian Conference on Computational Geometry (CCCG), pp. 107–111, 2008.
- Colour Patterns for Polychromatic Four-colourings of Rectangular Subdivisions
H. Haverkort, M. Löffler, E. Mumford, M. O'Meara, J. Snoeyink, and B. Speckmann.
Abstr. 24th European Workshop on Computational Geometry (EuroCG), pp. 75–78, 2008.
- On the Number of Empty Pseudo-Triangles in Point Sets
M. van Kreveld and B. Speckmann.
Proc. 19th Canadian Conference on Computational Geometry (CCCG), pp. 37–40, 2007.
- On (Pointed) Minimum Weight Pseudo-Triangulations
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann.
Proc. 19th Canadian Conference on Computational Geometry (CCCG), pp. 209–212, 2007.
- Maximizing Maximal Angles for Plane Straight Line Graphs
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, F. Santos, B. Speckmann, and B. Vogtenhuber.
Abstr. 23rd European Workshop on Computational Geometry (EuroCG), pp. 98–101, 2007.
- Kinetic kd-Trees
M.A. Abam, M. de Berg, and B. Speckmann.
Abstr. 23rd European Workshop on Computational Geometry (EuroCG), pp. 126–129, 2007.
- Edges and Switches, Tunnels and Bridges
D. Eppstein, M. van Kreveld, E. Mumford, and B. Speckmann.
Abstr. 23rd European Workshop on Computational Geometry (EuroCG), pp. 146–149, 2007.
- Kinetic Collision Detection for Balls Rolling on a Plane
M.A. Abam, M. de Berg, S.-H. Poon, and B. Speckmann.
Abstr. 22nd European Workshop on Computational Geometry (EuroCG), pp. 55–58, 2006.
- On Pseudo-Convex Decompositions, Partitions, and Coverings
O. Aichholzer, C. Huemer, S. Renkl, B. Speckmann, C.D. Tóth.
Abstr. 21st European Workshop on Computational Geometry (EuroCG), pp. 89–92, 2005.
- Area-Preserving Approximations of Polygonal Paths
P. Bose, S. Cabello, O. Cheong, J. Gudmundsson, M. van Kreveld, and B. Speckmann.
Accepted for presentation at Japan Conference on Discrete and Computational Geometry (JCDCG), 2004.
- On Rectangular Cartograms
M. van Kreveld and B. Speckmann.
Proc. 10th Annual Conference of the Advanced School for Computing and Imaging (ASCI), pp. 11–16, 2004.
- On Rectangular Cartograms
M. van Kreveld and B. Speckmann.
Abstr. 20th European Workshop on Computational Geometry (EuroCG), pp. 69–72, 2004.
- On the Number of Pseudo-Triangulations of Certain Point Sets
O. Aichholzer, D. Orden, F. Santos, and B. Speckmann.
Abstr. 20th European Workshop on Computational Geometry (EuroCG), pp. 119–122, 2004.
- Pointed Binary Encompassing Trees
M. Hoffmann, B. Speckmann, and C.D. Tóth.
Abstr. 20th European Workshop on Computational Geometry (EuroCG), pp. 131–134, 2004.
- Degree Bounds for Constrained Pseudo-Triangulations
O. Aichholzer, M. Hoffmann, B. Speckmann, and C.D. Tóth.
Proc. 15th Canadian Conference on Computational Geometry (CCCG), pp. 155–158, 2003.
- On the Number of Pseudo-Triangulations of Certain Point Sets
O. Aichholzer, D. Orden, F. Santos, and B. Speckmann.
Proc. 15th Canadian Conference on Computational Geometry (CCCG), pp. 141–144, 2003.
- The Path of a Pseudo-Triangulation
O. Aichholzer, B. Speckmann, and I. Streinu.
Abstr. DIMACS Workshop on Computational Geometry, 2002.
- Convexity Minimizes Pseudo-Triangulations
O. Aichholzer, F. Aurenhammer, H. Krasser, and B. Speckmann.
Proc. 14th Canadian Conference on Computational Geometry (CCCG), pp. 158–161, 2002.
- Vertex pi-guards in Simple Polygons
B. Speckmann and C.D. Tóth.
Abstr. 18th European Workshop on Computational Geometry, pp. 12–15, 2002.
- Tight Degree Bounds for Pseudo-triangulations of Points
L. Kettner, D. Kirkpatrick, and B. Speckmann.
Proc. 13th Canadian Conference on Computational Geometry (CCCG), pp. 117–120, 2001.
- Bounded-degree Pseudo-triangulations of Points
L. Kettner, A. Mantler, J. Snoeyink, B. Speckmann, and F. Takeuchi.
Abstr. 17th European Workshop on Computational Geometry (EuroCG), pp. 19–22, 2001.
- Separation Sensitive Kinetic Collision Detection for Simple Polygons
D. Kirkpatrick and B. Speckmann.
Abstr. 10th Annual Fall Workshop on Computational Geometry, 2000.
- Robust Regression Estimators
B. Speckmann.
Proc. 9th PRECARN-IRIS Conference, poster session, 1999.
- Tripod: a minimalist data structure for embedded triangulations
J. Snoeyink and B. Speckmann.
Proc. Workshop on Computational Graph Theory and Combinatorics, 1999.
- Easy Triangle Strips for TIN Terrain Models
B. Speckmann and J. Snoeyink.
Proc. 9th Canadian Conference on Computational Geometry (CCCG), pp. 239–244, 1997.
- Compact Triangulated Terrain Models
B. Speckmann.
Proc. 7th PRECARN-IRIS Conference, poster session, 1997.
|
|
|
- Placing Diagrams and Symbols on Maps
M. van Kreveld and B. Speckmann.
NVTI Niewsbrief (Newsletter of the Dutch Association for Theoretical Computer Science), 12:14–24, 2008.
- Algorithmic Aspects of Cartogram Computation
B. Speckmann.
Bulletin of the European Association for Theoretical Computer Science, 92:33–43, 2007.
- Algorithms for cartograms and other specialized maps
B. Speckmann.
Geo-information and computational geometry, P. van Oosterom and M. van Kreveld (eds.), Netherlands Geodetic Commission, 44:26-34, 2006.
- Automated construction of Rectangular Cartograms
M. van Kreveld and B. Speckmann.
XOOTIC Magazine, 11(1):5–11, 2005.
|
|
|
- Kinetic Data Structures
for Collision Detection
Bettina Speckmann.
PhD Thesis, Department of Computer Science, University of British
Columbia, 2001.
- Verschneidung einfach zusammenhängender planarer
Unterteilungen auf Basis der QCEL Datenstruktur
Bettina Speckmann.
Diplomarbeit (Master’s Thesis), Westfälische Wilhelms-Universität Münster, 1996.
|
|
last
modified:
31-Jul-2014
|
|
|
|
|