2009 |
55 | EE | Bernd Gärtner,
Joachim Giesen,
Martin Jaggi:
An Exponential Lower Bound on the Complexity of Regularization Paths
CoRR abs/0903.4817: (2009) |
54 | EE | Bernd Gärtner,
Joachim Giesen,
Martin Jaggi,
Torsten Welsch:
A Combinatorial Algorithm to Compute Regularization Paths
CoRR abs/0903.4856: (2009) |
53 | EE | Joachim Giesen,
Eva Schuberth,
Milos Stojakovic:
Approximate Sorting.
Fundam. Inform. 90(1-2): 67-72 (2009) |
2008 |
52 | | Joachim Giesen,
Madhusudan Manjunath,
Michael Eigensatz:
The Solution Path of the Slab Support Vector Machine.
CCCG 2008 |
51 | EE | Joachim Giesen,
Matthias John:
The flow complex: A data structure for geometric modeling.
Comput. Geom. 39(3): 178-190 (2008) |
50 | EE | Kevin Buchin,
Tamal K. Dey,
Joachim Giesen,
Matthias John:
Recursive geometry of the flow complex and topology of the flow complex filtration.
Comput. Geom. 40(2): 115-137 (2008) |
49 | EE | Lujin Wang,
Joachim Giesen,
Kevin T. McDonnell,
Peter Zolliker,
Klaus Mueller:
Color Design for Illustrative Visualization.
IEEE Trans. Vis. Comput. Graph. 14(6): 1739-1754 (2008) |
48 | EE | Tamal K. Dey,
Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction.
Int. J. Comput. Geometry Appl. 18(1/2): 29-61 (2008) |
47 | EE | Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Medial Axis Approximation and Unstable Flow Complex.
Int. J. Comput. Geometry Appl. 18(6): 533-565 (2008) |
2007 |
46 | EE | Joachim Giesen,
Dieter Mitsche,
Eva Schuberth:
Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation.
AAIM 2007: 58-67 |
45 | | Joachim Giesen,
Balint Miklos,
Mark Pauly:
Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm.
CCCG 2007: 105-108 |
44 | EE | Balint Miklos,
Joachim Giesen,
Mark Pauly:
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool.
Symposium on Computational Geometry 2007: 123-124 |
43 | EE | Tamal K. Dey,
Joachim Giesen,
Samrat Goswami:
Delaunay triangulations approximate anchor hulls.
Comput. Geom. 36(2): 131-143 (2007) |
42 | EE | Joachim Giesen,
Klaus Mueller,
Eva Schuberth,
Lujin Wang,
Peter Zolliker:
Conjoint Analysis to Measure the Perceived Quality in Volume Rendering.
IEEE Trans. Vis. Comput. Graph. 13(6): 1664-1671 (2007) |
41 | EE | Joachim Giesen,
Eva Schuberth,
Klaus Simon,
Peter Zolliker,
Oliver Zweifel:
Image-Dependent Gamut Mapping as Optimization Problem.
IEEE Transactions on Image Processing 16(10): 2401-2410 (2007) |
2006 |
40 | EE | Joachim Giesen,
Eva Schuberth,
Milos Stojakovic:
Approximate Sorting.
LATIN 2006: 524-531 |
39 | EE | Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Medial axis approximation and unstable flow complex.
Symposium on Computational Geometry 2006: 327-336 |
38 | EE | Niloy J. Mitra,
Leonidas J. Guibas,
Joachim Giesen,
Mark Pauly:
Probabilistic fingerprints for shapes.
Symposium on Geometry Processing 2006: 121-130 |
37 | EE | Joachim Giesen,
Frédéric Cazals,
Mark Pauly,
Afra Zomorodian:
The conformal alpha shape filtration.
The Visual Computer 22(8): 531-540 (2006) |
2005 |
36 | EE | Maike Buchin,
Joachim Giesen:
Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard.
CCCG 2005: 195-198 |
35 | EE | Kevin Buchin,
Joachim Giesen:
Flow Complex: General Structure and Algorithm.
CCCG 2005: 270-273 |
34 | EE | Joachim Giesen,
Dieter Mitsche:
Reconstructing Many Partitions Using Spectral Techniques.
FCT 2005: 433-444 |
33 | EE | Joachim Giesen,
Dieter Mitsche:
Boosting Spectral Partitioning by Sampling and Iteration.
ISAAC 2005: 473-482 |
32 | EE | Tamal K. Dey,
Joachim Giesen,
Samrat Goswami:
Delaunay triangulations approximate anchor hulls.
SODA 2005: 1028-1037 |
31 | EE | Tamal K. Dey,
Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction.
Symposium on Computational Geometry 2005: 218-227 |
30 | | Mark Pauly,
Niloy J. Mitra,
Joachim Giesen,
Markus H. Gross,
Leonidas J. Guibas:
Example-Based 3D Scan Completion.
Symposium on Geometry Processing 2005: 23-32 |
29 | EE | Joachim Giesen,
Dieter Mitsche:
Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model.
WG 2005: 409-420 |
2004 |
28 | EE | Joachim Giesen,
Simon Spalinger:
Meshless surface reconstruction by kernel clustering.
CCCG 2004: 11-14 |
27 | EE | Bernhard Schölkopf,
Joachim Giesen,
Simon Spalinger:
Kernel Methods for Implicit Surface Modeling.
NIPS 2004 |
26 | EE | Joachim Giesen,
Uli Wagner:
Shape Dimension and Intrinsic Metric from Samples of Manifolds.
Discrete & Computational Geometry 32(2): 245-267 (2004) |
2003 |
25 | EE | Joachim Giesen,
Matthias John:
The flow complex: a data structure for geometric modeling.
SODA 2003: 285-294 |
24 | EE | Tamal K. Dey,
Joachim Giesen,
Matthias John:
Alpha-shapes and flow shapes are homotopy equivalent.
STOC 2003: 493-502 |
23 | EE | Joachim Giesen,
Uli Wagner:
Shape dimension and intrinsic metric from samples of manifolds with high co-dimension.
Symposium on Computational Geometry 2003: 329-337 |
22 | | Joachim Giesen,
Matthias John:
Computing the Weighted Flow Complex.
VMV 2003: 235-243 |
21 | EE | Tamal K. Dey,
Joachim Giesen,
Samrat Goswami:
Shape Segmentation and Matching with Flow Discretization.
WADS 2003: 25-36 |
20 | EE | Tamal K. Dey,
Joachim Giesen,
Samrat Goswami,
Wulue Zhao:
Shape Dimension and Approximation from Samples.
Discrete & Computational Geometry 29(3): 419-434 (2003) |
19 | EE | Joachim Giesen,
Matthias John,
Michel Stöcklin:
Symmetry of Flow Diagrams Derived from Weighted Points in the Plane.
Int. J. Comput. Geometry Appl. 13(4): 327-337 (2003) |
2002 |
18 | EE | Joachim Giesen,
Matthias John:
The complexity of flow diagrams in the plane.
CCCG 2002: 45-48 |
17 | EE | Joachim Giesen,
Matthias John:
Duality in Disk Induced Flows.
International Conference on Computational Science (3) 2002: 154-163 |
16 | EE | Joachim Giesen,
Axel Völker:
Requirements Interdependencies and Stakeholders Preferences.
RE 2002: 206-212 |
15 | | Joachim Giesen,
Roger Wattenhofer,
Aaron Zollinger:
Towards a Theory of Peer-to-Peer Computability.
SIROCCO 2002: 115-132 |
14 | EE | Tamal K. Dey,
Joachim Giesen,
Samrat Goswami,
Wulue Zhao:
Shape dimension and approximation from samples.
SODA 2002: 772-780 |
13 | EE | Joachim Giesen,
Matthias John:
A New Diagram from Disks in the Plane.
STACS 2002: 238-249 |
12 | | Udo Adamy,
Joachim Giesen,
Matthias John:
Surface reconstruction using umbrella filters.
Comput. Geom. 21(1-2): 63-86 (2002) |
11 | EE | Joachim Giesen,
Matthias John:
Surface reconstruction based on a dynamical system.
Comput. Graph. Forum 21(3): (2002) |
2001 |
10 | EE | Tamal K. Dey,
Joachim Giesen,
James Hudson:
Decimating samples for mesh simplification.
CCCG 2001: 85-88 |
9 | EE | Tamal K. Dey,
Joachim Giesen,
James Hudson:
Delaunay based shape reconstruction from large data.
IEEE Symposium on Parallel and Large-Data Visualization and Graphics 2001: 19-27 |
8 | EE | Tamal K. Dey,
Joachim Giesen,
Samrat Goswami,
James Hudson,
Rephael Wenger,
Wulue Zhao:
Undersampling and Oversampling in Sample Based Shape Modeling.
IEEE Visualization 2001 |
7 | EE | Tamal K. Dey,
Joachim Giesen,
Wulue Zhao:
Robustness Issues in Surface Reconstruction.
International Conference on Computational Science (1) 2001: 658-662 |
6 | EE | Tamal K. Dey,
Joachim Giesen:
Detecting undersampling in surface reconstruction.
Symposium on Computational Geometry 2001: 257-263 |
2000 |
5 | | Udo Adamy,
Joachim Giesen,
Matthias John:
The Lambda-Complex and Surface Reconstruction.
EWCG 2000: 14-17 |
4 | EE | Udo Adamy,
Joachim Giesen,
Matthias John:
New techniques for topologically correct surface reconstruction.
IEEE Visualization 2000: 373-380 |
3 | EE | Joachim Giesen:
Curve Reconstruction, the Traveling Salesman Problem, and Menger's Theorem on Length.
Discrete & Computational Geometry 24(4): 577-603 (2000) |
1999 |
2 | EE | Joachim Giesen:
Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem.
DGCI 1999: 164-176 |
1 | EE | Joachim Giesen:
Curve Reconstruction, the Traveling Salesman Problem and Menger's Theorem on Length.
Symposium on Computational Geometry 1999: 207-216 |