A5091823049- Computational Geometry and Mesh Generation
- Advanced Graph Theory Research
- Digital Image Processing Techniques
- Advanced Numerical Analysis Techniques
- graph theory and CDMA systems
- Data Management and Algorithms
- Mathematics and Applications
- Optimization and Packing Problems
- 3D Modeling in Geospatial Applications
- Advanced Combinatorial Mathematics
- 3D Shape Modeling and Analysis
- Advanced Materials and Mechanics
- Complexity and Algorithms in Graphs
- Robotics and Sensor-Based Localization
- Optimization and Search Problems
- Remote Sensing and LiDAR Applications
- Point processes and geometric inequalities
- Graph Labeling and Dimension Problems
- VLSI and FPGA Design Techniques
- Limits and Structures in Graph Theory
- Graph Theory and Algorithms
- Topological and Geometric Data Analysis
- Structural Analysis and Optimization
- Algorithms and Data Compression
- Robotic Mechanisms and Dynamics
Graz University of Technology
2015-2024
University of California, Irvine
2022
Institute of Software
2009-2020
Software (Spain)
2015
Graz University Hospital
2013-2014
TU Wien
2006-2009
Institut für Informationsverarbeitung
2003
Abstract Simple drawings are of graphs in which the edges Jordan arcs and each pair share at most one point (a proper crossing or a common endpoint). A simple drawing is c-monotone if there O such that ray emanating from crosses edge once. We introduce special kind we call generalized twisted drawings. all drawing. Via this class drawings, show every complete graph with n vertices contains $$\Omega (n^{\frac{1}{2}})$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow>...
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdorff distance between sets is not larger than constant factor times minimum which can be achieved in this way. The just matches so-called Steiner points of sets. focus our paper general study reference (like point) and their properties with respect shape matching. more transformations translations, method eliminates several degrees freedom from problem thus yields good...
We prove that planar pseudotriangulations have realizations as polyhedral surfaces in three-space. Two main implications are presented. The spatial embedding leads to a novel flip operation allows for drastic reduction of distances, especially between (full) triangulations. Moreover, several key results triangulations, like flipping optimality, (constrained) Delaunayhood, and convex polytope representation, extended natural way.
Article Free Access Share on Voronoi diagrams for direction-sensitive distances Authors: Oswin Aichholzer Institute Theoretical Computer Science, Graz University of Technology, Graz, Austria AustriaView Profile , Danny Z. Chen Department Science & Engineering, Notre Dame, IN INView D. T. Lee Electrical and Northwestern University, Evanston, IL ILView Asish Mukhopadhyay Indian Kanpur, UP-208016, India IndiaView Evanthia Papadopoulou IBM Watson Research Center, Yorktown Heights, NY NYView...