Research output per year
Research output per year
Project Details
Description
Discrete and Computational geometry is a branch of geometry that studies combinatorial and algorithmic properties of discrete geometric objects, such as points, lines, circles, polygons, and higher dimensional counterparts. The subject focuses on the combinatorial properties of these objects, and the complexity of algorithmic solutions for a huge variety of problems, ranging from fundamental research to industrial applications.
| Status | Active |
|---|---|
| Effective start/end date | 1/01/05 → … |
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
-
All Good Drawings of Small Complete Graphs
Ábrego, B. M., Aichholzer, O., Fernández-Merchant, S., Hackl, T., Pammer, J., Pilz, A., Ramos, P., Salazar, G. & Vogtenhuber, B., 2015, Collection of Abstracts of the 31st European Workshop on Computational Geometry 2015. ., p. 57-60Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review
-
Embedding Four-directional Paths on Convex Point Sets
Aichholzer, O., Hackl, T., Lutteropp, S., Mchedlidze, T. & Vogtenhuber, B., 2015, In: Journal of Graph Algorithms and Applications . 19, 2, p. 743-759Research output: Contribution to journal › Article › peer-review
-
Empty triangles in good drawings of the complete graph
Aichholzer, O., Hackl, T., Pilz, A., Ramos, P., Sacristán, V. & Vogtenhuber, B., 2015, In: Graphs and Combinatorics. 31, 2, p. 335-345Research output: Contribution to journal › Article › peer-review