Roman Waupotitsch (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

5 Herbert Edelsbrunner, Roman Waupotitsch: Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes. Int. J. Comput. Geometry Appl. 10(3): 267-284 (2000)

4 Emo Welzl, Herbert Edelsbrunner, Roman Waupotitsch: A Combinatorial Approach to Cartograms. Comput. Geom. 7: 343-360 (1997)

3 Herbert Edelsbrunner, Roman Waupotitsch: A Combinatorial Approach to Cartograms. Symposium on Computational Geometry 1995: 98-108

2 Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch: An O(n²log n) Time Algorithm for the MinMax Angle Triangulation. Symposium on Computational Geometry 1990: 44-52

1 Herbert Edelsbrunner, Roman Waupotitsch: Computing a Ham-Sandwich Cut in Two Dimensions. J. Symb. Comput. 2(2): 171-178 (1986)

Selection of 5 from 9 records - Roman Waupotitsch has 8 coauthors

5		Herbert Edelsbrunner, Roman Waupotitsch: Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes. Int. J. Comput. Geometry Appl. 10(3): 267-284 (2000)
4		Emo Welzl, Herbert Edelsbrunner, Roman Waupotitsch: A Combinatorial Approach to Cartograms. Comput. Geom. 7: 343-360 (1997)
3		Herbert Edelsbrunner, Roman Waupotitsch: A Combinatorial Approach to Cartograms. Symposium on Computational Geometry 1995: 98-108
2		Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch: An O(n²log n) Time Algorithm for the MinMax Angle Triangulation. Symposium on Computational Geometry 1990: 44-52
1		Herbert Edelsbrunner, Roman Waupotitsch: Computing a Ham-Sandwich Cut in Two Dimensions. J. Symb. Comput. 2(2): 171-178 (1986)