Research Output 1968 2019

2019

Advanced light-field refocusing through tomographic modeling of the photographed scene

Viganò, N., Gil, P. M., Herzog, C., de la Rochefoucauld, O., van Liere, R. & Batenburg, K. J., 1 Jun 2019, In : Optics Express. 27, 6, p. 7834-7856 23 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
formulations
photography
point spread functions
frequency response
artifacts

Algorithmic approaches to reconfigurable assembly systems

Costa, A., Abdel-Rahman, A., Jenett, B., Gershenfeld, N., Kostitsyna, I. & Cheung, K., 6 Dec 2019, 2019 IEEE Aerospace Conference, AERO 2019. Piscataway: Institute of Electrical and Electronics Engineers, 8 p. 8741572

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

robotics
Robotics
assembly
fault tolerance
structural design

Algorithms for river network analysis

Sonke, W. M., 29 Aug 2019, (Accepted/In press) Eindhoven: Technische Universiteit Eindhoven. 154 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Algorithms for visualization in digital humanities

Castermans, T., 29 Aug 2019, (Accepted/In press) Eindhoven: Technische Universiteit Eindhoven.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Approximating (k,ℓ)-center clustering for curves

Buchin, K., Driemel, A., Gudmundsson, J., Horton, M., Kostitsyna, I., Löffler, M. & Struijs, M., 2 Jan 2019, 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Chan, T. M. (ed.). Society for Industrial and Applied Mathematics (SIAM), p. 2922-2938 17 p.

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Open Access
Clustering
Curve
Simplification
Approximation
Hardness of Approximation

A practical algorithm for spatial agglomerative clustering

Castermans, T., Speckmann, B. & Verbeek, K., 2019, Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments. Philadelphia: Society for Industrial and Applied Mathematics (SIAM), p. 174-185 12 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Spatial Clustering
Quadtree
Clustering
Inverse function
Hierarchical Clustering

A spanner for the day after

Buchin, K., Har-Peled, S. & Oláh, D., 1 Jun 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 19. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 129)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File

Combining interactive hierarchy visualizations in a web-based application

Burch, M., Aerts, W., Bon, D., McCarren, S., Rothuizen, L., Smet, O. & Wöltgens, D., Feb 2019, VISIGRAPP 2019 - Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications. Kerren, A., Hurter, C. & Braz, J. (eds.). Setúbal: SCITEPRESS-Science and Technology Publications, Lda., p. 191-198 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Visualization
Taxonomies
Sports
Software engineering
Servers

Convex polygons in Cartesian products

De Carufel, J. L., Dumitrescu, A., Meulemans, W., Ophelders, T., Pennarun, C., Tóth, C. D. & Verdonschot, S., 1 Jun 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 22. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 129)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Polynomials

Dynamic conflict-free colorings in the plane

de Berg, M. & Markovic, A., 1 Jun 2019, In : Computational Geometry: Theory and Applications. 78, p. 61-73

Research output: Contribution to journalArticleAcademicpeer-review

Coloring
Colouring
Insertion
Color
Deletion

Dynamic graph coloring

Barba, L., Cardinal, J., Korman, M., Langerman, S., van Renssen, A., Roeloffzen, M. & Verdonschot, S., Apr 2019, In : Algorithmica. 81, 4, p. 1319-1341 23 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Dynamic Graphs
Graph Coloring
Coloring
Colouring
Update

Dynamic range and frequency assignment problems

Markovic, A., 5 Feb 2019, Eindhoven: Technische Universiteit Eindhoven. 150 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File
2 Citations (Scopus)

Effects of environment knowledge in evacuation scenarios involving fire and smoke: a multiscale modelling and simulation approach

Richardson, O., Jalba, A. & Muntean, A., Mar 2019, In : Fire Technology. 55, 2, p. 415-436 22 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Smoke
Fires
Macros
Geometry

Efficient and accurate collision response for elastically deformable models

Verschoor, M. & Jalba, A. C., 1 Apr 2019, In : ACM Transactions on Graphics. 38, 2, 20 p., 17

Research output: Contribution to journalArticleAcademicpeer-review

Lagrange multipliers
Friction

ETH-tight algorithms for geometric network problems

Kisfaludi-Bak, S., 27 Jun 2019, Eindhoven: Technische Universiteit Eindhoven. 196 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Eventpad: Rapid malware analysis and reverse engineering using visual analytics

Cappers, B. C. M., Meessen, P. N., Etalle, S. & Van Wijk, J. J., 9 May 2019, 2018 IEEE Symposium on Visualization for Cyber Security, VizSec 2018. Trent, S., Kohlhammer, J., Sauer, G., Gove, R., Best, D., Paul, C. L., Prigent, N. & Staheli, D. (eds.). Institute of Electrical and Electronics Engineers, 8 p. 8709230

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Reverse engineering
Data visualization
Data reduction
Agglomeration
Personnel

Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement)

Hinnenthal, K., Scheideler, C. & Struijs, M., 17 Jun 2019, SPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. New York: Association for Computing Machinery, Inc, p. 393-394 2 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Distributed Algorithms
Parallel algorithms
Fast Algorithm
Gossip
Linear programming

Interactive process mining

Dixit, P. A. M., 19 Jun 2019, Eindhoven: Technische Universiteit Eindhoven. 265 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Kinetic volume-based persistence for 1D terrains

Ophelders, T., Sonke, W., Speckmann, B. & Verbeek, K., 18 Mar 2019, p. 38:1-38:7 7 p.

Research output: Contribution to conferenceAbstractAcademic

Open Access
File
persistence
kinetics
geomorphology

Locally correct Fréchet matchings

Buchin, K., Buchin, M., Meulemans, W. & Speckmann, B., 1 Jan 2019, In : Computational Geometry: Theory and Applications. 76, p. 1-18 18 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
Curve
Monotone
Metric

Lower bounds for protrusion replacement by counting equivalence classes

Jansen, B. M. P. & Wulms, J. J. H. M., 5 Mar 2019, (Accepted/In press) In : Discrete Applied Mathematics.

Research output: Contribution to journalArticleAcademicpeer-review

Equivalence classes
Equivalence class
Replacement
Counting
Lower bound

Maximum physically consistent trajectories

Custers, B., van de Kerkhof, M., Meulemans, W., Speckmann, B. & Staals, F., 15 Feb 2019 6 p.

Research output: Contribution to conferenceAbstractAcademic

Open Access
File
trajectories
physics
output

Minimum perimeter-sum partitions in the plane

Abrahamsen, M., de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 1 Jan 2019, In : Discrete and Computational Geometry. 23 p.

Research output: Contribution to journalArticleAcademicpeer-review

Perimeter
Partition
Approximation algorithms
Exact Algorithms
Pi
1 Citation (Scopus)

Nearly ETH-tight algorithms for planar Steiner Tree with terminals on few faces

Kisfaludi-Bak, S., Nederlof, J. & van Leeuwen, E. J., 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). New York: Association for Computing Machinery, Inc, p. 1015-1034 20 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
Steiner Tree
Face
Graph in graph theory
Steiner Tree Problem
Trees (mathematics)

Non-crossing paths with geographic constraints

Silveira, R. I., Speckmann, B. & Verbeek, K., 23 May 2019, In : Discrete Mathematics and Theoretical Computer Science. 21, 3, 13 p.

Research output: Contribution to journalArticleAcademic

Open Access
File
Polynomials
Path
Vertical
Line segment
Convex Hull

On exploring always-connected temporal graphs of small pathwidth

Bodlaender, H. L. & van der Zanden, T. C., 1 Feb 2019, In : Information Processing Letters. 142, p. 68-71 4 p.

Research output: Contribution to journalArticleAcademicpeer-review

Pathwidth
Computational complexity
Graph in graph theory
NP-complete problem

Packing plane spanning graphs with short edges in complete geometric graphs

Aichholzer, O., Hackl, T., Korman, M., Pilz, A., van Renssen, A., Roeloffzen, M., Rote, G. & Vogtenhuber, B., 1 Sep 2019, In : Computational Geometry: Theory and Applications. 82, p. 1-15 15 p.

Research output: Contribution to journalArticleAcademicpeer-review

Geometric Graphs
Complete Graph
Packing
Sensor networks
Graph in graph theory

Preprocessing ambiguous imprecise points

Hoog, I. V. D., Kostitsyna, I., Löffler, M. & Speckmann, B., 1 Jun 2019, 35th International Symposium on Computational Geometry (SoCG 2019). Barequet, G. & Wang, Y. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 129, p. 42:1-42:16 16 p. 42. (Leibniz International Proceedings in Informatics (LIPIcs))

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Ambiguous
Preprocessing
Entropy
Sorting
Overlap

Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)

Buchin, K., Kostitsyna, I., Löffler, M. & Silveira, R. I., 1 Jul 2019, In : Algorithmica. 81, 7, p. 2682–2715

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Visibility
Probability distributions
Probability density function
Probability Distribution
Polygon

RegressionExplorer: Interactive exploration of logistic regression models with subgroup analysis

Dingen, D., van 't Veer, M., Houthuizen, P., Mestrom, E. H. J., Korsten, E. H. H. M., Bouwman, A. R. A. & van Wijk, J., 1 Jan 2019, In : IEEE Transactions on Visualization and Computer Graphics. 25, 1, p. 246-255 10 p.

Research output: Contribution to journalArticleAcademicpeer-review

Logistics

Removing depth-order cycles among triangles: an algorithm generating triangular fragments

de Berg, M., 23 May 2019, In : Discrete and Computational Geometry.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
Triangular
Triangle
Fragment
Cycle
Computer graphics

Routing in histograms

Chiu, M. K., Cleve, J., Katharina, K., Korman, M., Mulzer, W., van Renssen, A. M., Roeloffzen, M. & Willert, M., 18 Mar 2019, p. 18:1-18:8 8 p.

Research output: Contribution to conferenceAbstractAcademic

Open Access
File
Histogram
Routing
Table
Vertex of a graph
Orthogonal Polygons

Seth says: weak Fréchet distance is faster, but only if it is continuous and in one dimension

Buchin, K., Ophelders, T. & Speckmann, B., 1 Jan 2019, SODA '19 Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. New York: Association for Computing Machinery, Inc, p. 2887-2899 13 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

One Dimension
Curve
Lower bound
Exact Algorithms
Linear Time

Shortcuts for the circle

Bae, S. W., de Berg, M., Cheong, O., Gudmundsson, J. & Levcopoulos, C., 1 Feb 2019, In : Computational Geometry: Theory and Applications. 79, p. 37-54 18 p.

Research output: Contribution to journalArticleAcademicpeer-review

Circle
Plane Graph
Augmentation
Graph in graph theory
Unit circle

Simulation and animation of deformable solids

Verschoor, M., 27 May 2019, Eindhoven: Technische Universiteit Eindhoven. 223 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File
animation
simulation

Stability analysis of kinetic orientation-based shape descriptors

Meulemans, W., Verbeek, K. & Wulms, J., 27 Mar 2019, In : arXiv. 18 p., ArXiv:1903.11445v1

Research output: Contribution to journalArticleAcademic

Open Access
File
Kinetics
Costs

Stability analysis of kinetic oriented bounding boxes

Meulemans, W., Verbeek, K. & Wulms, J., 2019, p. 39:1-39:7 7 p.

Research output: Contribution to conferenceAbstractAcademic

Open Access
File
Kinetics

Stable divisorial gonality is in NP

Bodlaender, H. L., van der Wegen, M. & van der Zanden, T. C., 11 Jan 2019, SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Královič, R., Nawrocki, J., Pighizzini, G. & Catania, B. (eds.). Cham: Springer, p. 81-93 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11376 LNCS)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Gonality
Linear programming
Polynomials
Geometry
Subdivision

Subgraph isomorphism on graph classes that exclude a substructure

Bodlaender, H. L., Hanaka, T., Okamoto, Y., Otachi, Y. & van der Zanden, T. C., 6 Apr 2019, Algorithms and Complexity - 11th International Conference, CIAC 2019, Proceedings. Heggernes, P. (ed.). Cham: Springer, p. 87-98 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11485 LNCS)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Forbidden Minor
Graph Classes
Substructure
Byproducts
Subgraph
2 Citations (Scopus)

The complexity of Dominating set in geometric intersection graphs

de Berg, M., Kisfaludi-Bak, S. & Woeginger, G., May 2019, In : Theoretical Computer Science. 769, p. 18-31 14 p.

Research output: Contribution to journalArticleAcademicpeer-review

Geometric Graphs
Intersection Graphs
Dominating Set
Interval
Semi-algebraic Sets

The homogeneous broadcast problem in narrow and wide strips I: algorithms

de Berg, M., Bodlaender, H. L. & Kisfaludi-Bak, S., Jul 2019, In : Algorithmica. 81, 7, p. 2934-2962 29 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Broadcast
Strip
Wireless networks
Hardness
Polynomials
1 Citation (Scopus)

The homogeneous broadcast problem in narrow and wide strips II: lower bounds

de Berg, M., Bodlaender, H. L. & Kisfaludi-Bak, S., Jul 2019, In : Algorithmica. 81, 7, p. 2963-2990 28 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Broadcast
Strip
Computational complexity
Wireless networks
Lower bound

Tight parameterized preprocessing bounds: sparsification via low-degree polynomials

Pieterse, A., 4 Sep 2019, (Accepted/In press) Eindhoven: Technische Universiteit Eindhoven.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Topological stability of kinetic k-centers

van der Hoog, I., van Kreveld, M., Meulemans, W., Verbeek, K. & Wulms, J., 2019, WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings. Nakano, S., Das, G. K., Mandal, P. S. & Mukhopadhyaya, K. (eds.). Cham: Springer, p. 43-55 13 p. (Lecture Notes in Computer Science; vol. 11355)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Kinetics
Upper and Lower Bounds
Radius
P-point
Center Problem

V-awake: a visual analytics approach for correcting sleep predictions from deep learning models

Garcia Caballero, H., Westenberg, M., Gebre, B. & van Wijk, J., 21 Mar 2019 12 p.

Research output: Contribution to conferencePaperAcademic

Open Access
File
Sleep
Deep learning

Volume-based large dynamic graph analysis supported by evolution provenance

Bruder, V., Ben Lahmar, H., Hlawatsch, M., Frey, S., Burch, M., Weiskopf, D., Herschel, M. & Ertl, T., 29 Jun 2019, In : Multimedia Tools and Applications.

Research output: Contribution to journalArticleAcademicpeer-review

Visualization
Volume rendering
Scalability
Agglomeration
Graphics processing unit
2018

A faster parameterized algorithm for PSEUDOFOREST DELETION

Bodlaender, H. L., Ono, H. & Otachi, Y., 19 Feb 2018, In : Discrete Applied Mathematics. 236, p. 42-56

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Parameterized Algorithms
Fast Algorithm
Polynomials
Connected Components
Graph in graph theory
1 Citation (Scopus)

A framework for algorithm stability and its application to kinetic euclidean MSTs

Meulemans, W., Speckmann, B., Verbeek, K. & Wulms, J., 1 Jan 2018, LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Bender, M. A., Farach-Colton, M. & Mosteiro, M. A. (eds.). Dordrecht: Springer, p. 805-819 15 p. (Lecture Notes in Computer Science; vol. 10807)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Minimum Spanning Tree
Euclidean
Kinetics
Lipschitz Stability
Combinatorial Algorithms

A framework for algorithm stability and its application to kinetic Euclidean MSTs

Meulemans, W., Speckmann, B., Verbeek, K. A. B. & Wulms, J. J. H. M., 2018, p. 11:1-11:6 6 p.

Research output: Contribution to conferenceAbstractAcademic

Open Access
File
Kinetics
Learning systems
Numerical analysis
Topology
2 Citations (Scopus)

A framework for ETH-Tight algorithms and lower bounds in geometric intersection graphs∗†

de Berg, M., Bodlaender, H. L., Kisfaludi-Bak, S., Marx, D. & van der Zanden, T. C., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc, p. 51-64 14 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Oils and fats
Separators