Thérèse Biedl
Impact in
-
- Computational Geometry and Mesh Generation
- Computer Graphics and Visualization Techniques
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Computational Geometry and Mesh Generation 66
- Computer Graphics and Visualization Techniques 7
-
- Advanced Graph Theory Research 23
- Co-authors
- Goos KantErik D. DemaineAnna LubiwSue WhitesidesStephen KobourovMichael KaufmannSteve RobbinsSylvain Lazard
- Journals
- Computational Geometry (9 papers)Journal of Graph Algorithms and Applications (7 papers)Discrete Applied Mathematics (6 papers)Algorithmica (5 papers)Discrete & Computational Geometry (5 papers)
- Partner nations
- CanadaUnited StatesGermany
In The Last Decade
Thérèse Biedl
78 papers receiving 561 citations
Peers
Comparison fields: 5 of 67
- Computer Graphics and Computer-Aided Design 345
- Computational Theory and Mathematics 223
- Computer Vision and Pattern Recognition 219
- Discrete Mathematics and Combinatorics 23
- Signal Processing 61
Countries citing papers authored by Thérèse Biedl
This map shows the geographic impact of Thérèse Biedl's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Thérèse Biedl with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thérèse Biedl more than expected).
Fields of papers citing papers by Thérèse Biedl
This network shows the impact of papers produced by Thérèse Biedl. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Thérèse Biedl. The network helps show where Thérèse Biedl may publish in the future.
Co-authors
The 25 scholars most cited alongside Thérèse Biedl, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 8 | |
| 2 | Realizing Farthest-Point Voronoi Diagrams. | 2016 | 1 |
| 3 | 2012 | 5 | |
| 4 | Drawing some planar graphs with integer edge-lengths. | 2011 | 1 |
| 5 | 2008 | 1 | |
| 6 | Drawing Planar Bipartite Graphs With Small Area | 2005 | 5 |
| 7 | Complexity of Octagonal and Rectangular Cartograms. | 2005 | 11 |
| 8 | The complexity of domino tiling. | 2005 | 1 |
| 9 | When can a graph form an orthogonal polyhedron | 2004 | 1 |
| 10 | Parallel morphing of trees and cycles. | 2003 | 2 |
| 11 | Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. | 2002 | 1 |
| 12 | 2001 | 1 | |
| 13 | 1-bend 3-D orthogonal drawings: two open problems solved. | 2000 | 1 |
| 14 | Locked and Unlocked Polygonal Chains in Three Dimensions | 1999 | 1 |
| 15 | When can a net fold to a polyhedron. | 1999 | 4 |
| 16 | Hiding disks in folded polygons. | 1998 | 4 |
| 17 | Drawing Planar Partitions II: HH-Drawings | 1998 | 7 |
| 18 | 1998 | 27 | |
| 19 | Unfolding Some Classes of Orthogonal Polyhedra | 1998 | 28 |
| 20 | Optimal Orthogonal Drawings of Connected Plane Graphs | 1996 | 2 |
About Thérèse Biedl
Thérèse Biedl is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Signal Processing and Computational Mechanics, having authored 83 papers that have together received 631 indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (66 papers), Digital Image Processing Techniques (25 papers), Advanced Graph Theory Research (23 papers), Advanced Materials and Mechanics (9 papers), Robotics and Sensor-Based Localization (9 papers), Data Management and Algorithms (7 papers), Computer Graphics and Visualization Techniques (7 papers) and graph theory and CDMA systems (6 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (345 citations), Computational Theory and Mathematics (223 citations), Computer Vision and Pattern Recognition (219 citations), Discrete Mathematics and Combinatorics (23 citations) and Signal Processing (61 citations). Thérèse Biedl has collaborated with scholars based in Canada, United States and Germany. Frequent co-authors include Goos Kant, Erik D. Demaine, Anna Lubiw, Sue Whitesides, Stephen Kobourov, Michael Kaufmann, Steve Robbins, Sylvain Lazard, Martin L. Demaine and Stefan Huber. Their work appears in journals such as Computational Geometry, Journal of Graph Algorithms and Applications, Discrete Applied Mathematics, Algorithmica and Discrete & Computational Geometry.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.