Search

Your search keyword '"Sub Computational Geometry"' showing total 259 results
Start Over Author "Sub Computational Geometry"
259 results on '"Sub Computational Geometry"'

51. Regular meshes from polygonal paterns

Author

Sub Computational Geometry, Sub Computer Graphics, Computer Graphics, Vaxman, Amir, Müller, Christian, Weber, Ofir, Sub Computational Geometry, Sub Computer Graphics, Computer Graphics, Vaxman, Amir, Müller, Christian, and Weber, Ofir

Published
2017

53. Clustering Trajectories for Map Construction

Author

Sub Computational Geometry, Computational Geometry, Buchin, Kevin, Buchin, Maike, Duran, David, Fasy, Brittany, Jacobs, Roal, Sacristán, Vera, Silveira, R.I., Staals, F., Wenk, Carola, Hoel, Erik, Newsam, Shawn, Ravada, Siva, Tamassia, Roberto, Trajcevski, Goce, Sub Computational Geometry, Computational Geometry, Buchin, Kevin, Buchin, Maike, Duran, David, Fasy, Brittany, Jacobs, Roal, Sacristán, Vera, Silveira, R.I., Staals, F., Wenk, Carola, Hoel, Erik, Newsam, Shawn, Ravada, Siva, Tamassia, Roberto, and Trajcevski, Goce

Published
2017

54. Linear-size Universal Point Sets for One-bend Drawings

Author

Löffler, Maarten, Tóth, Csaba, Sub Computational Geometry, and Computational Geometry

Subjects
Mathematics::Combinatorics, GD, Point set, CG, Computer Science::Computational Geometry, Graph, Planar graph, Combinatorics, symbols.namesake, Line segment, Planar, symbols, CG, GRAPH, GD, Embedding, GRAPH, Mathematics
Abstract

For every integer $$n\ge 4$$, we construct a planar point set $$S_n$$ of size $$6n-10$$ such that every n-vertex planar graph G admits a plane embedding in which the vertices are mapped to points in $$S_n$$, and every edge is either a line segment or a polyline with one bend, where the bend point is also in $$S_n$$.

Published
2015

55. Modeling Checkpoint-Based Movement with the Earth Mover’s Distance

Author

Sub Computational Geometry, Computational Geometry, Duckham, Matt, van Kreveld, Marc|info:eu-repo/dai/nl/07492253X, Purves, Ross, Speckmann, Bettina, Tao, Yaguang, Verbeek, Kevin, Wood, Jo, Sub Computational Geometry, Computational Geometry, Duckham, Matt, van Kreveld, Marc|info:eu-repo/dai/nl/07492253X, Purves, Ross, Speckmann, Bettina, Tao, Yaguang, Verbeek, Kevin, and Wood, Jo

Published
2016

56. A Refined Definition for Groups of Moving Entities and its Computation

Author

Sub Computational Geometry, Computational Geometry, Kreveld, Marc van, Löffler, Maarten, Staals, Frank, Wiratma, Lionov, Hong, Seok-Hee, Sub Computational Geometry, Computational Geometry, Kreveld, Marc van, Löffler, Maarten, Staals, Frank, Wiratma, Lionov, and Hong, Seok-Hee

Published
2016

57. On the complexity of minimum-link path problems

Author

Sub Computational Geometry, Computational Geometry, Kostitsyna, Irina, Löffler, Maarten, Staals, Frank, Polishchuk, Valentin, Sub Computational Geometry, Computational Geometry, Kostitsyna, Irina, Löffler, Maarten, Staals, Frank, and Polishchuk, Valentin

Published
2016

58. Space-Efficient Hidden Surface Removal

Author

Sub Computational Geometry, Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Kammer, Frank, Löffler, Maarten, Silveira, Rodrigo I., Sub Computational Geometry, Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Kammer, Frank, Löffler, Maarten, and Silveira, Rodrigo I.

Published
2016

59. Minimizing Co-location Potential of Moving Entities

Author

Sub Computational Geometry, Computational Geometry, Evans, Will, Kirkpatrick, David, Löffler, Maarten, Staals, Frank, Sub Computational Geometry, Computational Geometry, Evans, Will, Kirkpatrick, David, Löffler, Maarten, and Staals, Frank

Published
2016

60. Multi-Colored Spanning Graphs

Author

Sub Computational Geometry, Computational Geometry, Akatya, Hugo, Löffler, Maarten, Tóth, Csaba, Sub Computational Geometry, Computational Geometry, Akatya, Hugo, Löffler, Maarten, and Tóth, Csaba

Published
2016

61. Homotopy Measures for Representative Trajectories

Author

Sub Computational Geometry, Computational Geometry, Chambers, Erin W., Kostitsyna, Irina, Löffler, Maarten, Staals, Frank, Sub Computational Geometry, Computational Geometry, Chambers, Erin W., Kostitsyna, Irina, Löffler, Maarten, and Staals, Frank

Published
2016

62. A Hexagon-Shaped Stable Kissing Unit Disk Tree

Author

Sub Computational Geometry, Computational Geometry, Chiu, Man-Kwun, Löffler, Maarten, Roeloffzen, Marcel, Uehara, Ryuhei, Sub Computational Geometry, Computational Geometry, Chiu, Man-Kwun, Löffler, Maarten, Roeloffzen, Marcel, and Uehara, Ryuhei

Published
2016

63. Recognizing a DOG is Hard but not when it is Thin and Unit

Author

Sub Computational Geometry, Computational Geometry, Evans, Will, Garderen, Mereke van, Löffler, Maarten, Polishchuk, Valentin, Sub Computational Geometry, Computational Geometry, Evans, Will, Garderen, Mereke van, Löffler, Maarten, and Polishchuk, Valentin

Published
2016

64. Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance

Author

Sub Computational Geometry, Computational Geometry, Bouts, Quirijn W., Kostitsyna, Irina Irina, Kreveld, Marc van, Meulemans, Wouter, Sonke, Willem, Verbeek, Kevin, Sankowski, Piotr, Zaroliagis, Christos, Sub Computational Geometry, Computational Geometry, Bouts, Quirijn W., Kostitsyna, Irina Irina, Kreveld, Marc van, Meulemans, Wouter, Sonke, Willem, Verbeek, Kevin, Sankowski, Piotr, and Zaroliagis, Christos

Published
2016

65. Circles in the Water: Towards Island Group Labeling

Author

Sub Computational Geometry, Computational Geometry, van Goethem, Arthur, van Kreveld, Marc, Speckmann, Bettina, Miller, Jennifer A., O'Sullivan, David, Wiegand, Nancy, Sub Computational Geometry, Computational Geometry, van Goethem, Arthur, van Kreveld, Marc, Speckmann, Bettina, Miller, Jennifer A., O'Sullivan, David, and Wiegand, Nancy

Published
2016

66. Grouping time-varying data for interactive exploration

Author

Sub Computational Geometry, Computational Geometry, van Goethem, Arthur, van Kreveld, Marc, Löffler, Maarten, Speckmann, Bettina, Staals, Frank, Sub Computational Geometry, Computational Geometry, van Goethem, Arthur, van Kreveld, Marc, Löffler, Maarten, Speckmann, Bettina, and Staals, Frank

Published
2016

67. Segmentation of Trajectories on Nonmonotone Criteria

Author

Sub Computational Geometry, Computational Geometry, Aronov, B., Driemel, A., van Kreveld, M.J., Löffler, M., Staals, F., Sub Computational Geometry, Computational Geometry, Aronov, B., Driemel, A., van Kreveld, M.J., Löffler, M., and Staals, F.

Published
2016

70. Single-Player and Two-Player Buttons & Scissors Games

Author

Sub Computational Geometry, Computational Geometry, Burke, Kyle, Demaine, Erik, Gregg, Harrison, Hearn, Robert, Hesterberg, Adam, Hoffman, Michael, Ito, Hiro, Kostitsyna, Irina, Leonard, Jody, Löffler, Maarten, Schmidt, Christiane, Uehara, Ryuhei, Uno, Yushi, Williams, Aaron, Sub Computational Geometry, Computational Geometry, Burke, Kyle, Demaine, Erik, Gregg, Harrison, Hearn, Robert, Hesterberg, Adam, Hoffman, Michael, Ito, Hiro, Kostitsyna, Irina, Leonard, Jody, Löffler, Maarten, Schmidt, Christiane, Uehara, Ryuhei, Uno, Yushi, and Williams, Aaron

Published
2016

72. Strict Confluent Drawing

Author

Sub Computational Geometry, Computational Geometry, Eppstein, David, Holten, Danny, Löffler, Maarten, Nöllenburg, Martin, Speckmann, Bettina, Verbeek, Kevin, Sub Computational Geometry, Computational Geometry, Eppstein, David, Holten, Danny, Löffler, Maarten, Nöllenburg, Martin, Speckmann, Bettina, and Verbeek, Kevin

Published
2016

73. Query Strategies for Minimizing the Ply of the Potential Locations of Entities Moving with Different Speeds

Author

Evans, Will, Kirkpatrick, David, Löffler, Maarten, Staals, Frank, Sub Computational Geometry, and Computational Geometry

Abstract

In a recent paper [2] we gave query strategies for minimizing the ply of the potential locations of a set of moving entities. We extend our results to the case where the entities have dierent maximum speeds. We present a query strategy that can achieve ply O(k) when we have at least 2n time, the intrinsic ply of the entities is , and the speeds of the entities fall into k speed classes. Furthermore, we show that for every query strategy there is a set of n entities for which the strategy achieves ply (k). Hence, our results are optimal up to a constant factor. We present our query strategy for entities moving in R1. However, our results extend to higher dimensions.

Published
2014

74. Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition

Author

Löffler, Maarten, Mulzer, Wolfgang, Sub Computational Geometry, and Computational Geometry

Subjects
CG, DS, IMP, CH
Abstract

Let D be a set of n pairwise disjoint unit disks in the plane. We describe how to build a data structure for D so that for any point set P containing exactly one point from each disk, we can quickly nd the onion decomposition (convex layers) of P. Our data structure can be built in O(n log n) time and has linear size. Given P, we can nd its onion decomposition in O(n log k) time, where k is the number of layers. We also provide a matching lower bound. Our solution is based on a recursive space decomposition, combined with a fast algorithm to compute the union of two disjoint onion decompositions.

Published
2014

75. Interaction and Collective Movement Processing: Report from Dagstuhl Seminar 14132

Author

Buchin, Maike, Giuggioli, Luca, Theraulaz, Guy, van Kreveld, Marc, Computational Geometry, and Sub Computational Geometry

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 14132 “Interaction and Collective Movement Processing”. This seminar brought together a group of 30 scientists with varied backgrounds, but with a shared interest in computations involved in the processing of moving entity data, like humans or animals. The seminar focused on characterizing and modelling interaction between moving entities, and featured four invited talks in four main research fields: ecology, computational geometry, GIScience, and collective motion. The remainder of the program consisted of short presentations, open problem sessions, break-out groups to work on open problems, and reporting sessions based on research done in the break-out groups.

Published
2014

76. Realistic Analysis for Algorithmic Problems on Geographical Data

Author

Driemel, A., Computational Geometry, Sub Computational Geometry, van Kreveld, Marc, de Berg, M.T., and University Utrecht

Subjects
geographic information science, Voronoi diagrams, computational geometry, trajectories, hydrology, terrains
Abstract

The worst-case analysis is a key element of the performance analysis of algorithms. When it comes to spatial data, such as paths of moving objects and digital terrain models, the theoretical worst case may be a contrived configuration which would never occur in practice. In this case the algorithmic analysis may fail to describe the actual behavior of an algorithm. To remedy this, a collection of techniques have been developed, which enable a realistic analysis with mathematically provable bounds. Realistic input models capture geometric parameters such as the distribution and shape of the input objects. This allows for a specific analysis that takes the difficulty of the input instance into account and is therefore also meaningful for input instances that are less difficult. In this thesis we revisit some well-studied problems of computational geometry with a realistic analysis. We first study the Frechet distance, a similarity measure for outlines of shapes or paths of moving objects. Under a new realistic input model, we can approximate the Frechet distance in near-linear time, where previous algorithms run in quadratic time. We extend our algorithm so that it can be applied to a sophisticated variant, the shortcut Frechet distance, which captures partial similarity. We show that computing this new variant exactly is NP-hard. Along the way, we develop data structures to answer Frechet-distance queries. In the second part of the thesis, we study computations on digital terrain models, which represent geographic regions. A terrain model can be used to simulate where rain water flows to, which is useful for flood prediction for instance. Although these computations are extremely sensitive to elevation error, none of the known algorithms take noise into account. We develop a theory that enables robust and efficient hydrological computations if the elevation data from which the terrain model was derived was imprecise. While the new theory uses fixed flow directions, we also show that an extension of our methods to continuous directions will be difficult. In particular, we show that it is NP-hard to determine if there can be a steepest descent path between two points on an imprecise polyhedral surface. The Voronoi diagram is an important geometric structure that can be used to answer queries for the closest point of interest. The "closeness" can be defined by the length of the shortest path along the terrain surface. The efficiency depends among other things on the amount of space taken up by the diagram. According to the classical worst-case analysis the space grows quadratically with the size of the terrain. However, this quadratic behavior cannot be observed in practice. In the last part of the thesis we analyze the size of the Voronoi diagram under the assumption that the points of interest are distributed uniformly on the terrain surface. Our results confirm a conjecture by Aronov, de Berg and Thite from 2008 that in a realistic setting the complexity of the diagram is additively linear in the size of the terrain and the number of sites.

Published
2013

77. Clear Unit-Distance Graphs

Author

van Kreveld, Marc, Löffler, Maarten, Staals, Frank, Sub Computational Geometry, and Computational Geometry

Subjects
CG, GRAPH, GD
Abstract

We introduce a variation of unit-distance graphs which we call emph clear unit-distance graphs. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs.

Published
2013

78. Automated Puzzle Difficulty Estimation

Author

Computational Geometry, Sub Computational Geometry, Kreveld, Marc van, Löffler, Maarten, Mutser, Paul, Computational Geometry, Sub Computational Geometry, Kreveld, Marc van, Löffler, Maarten, and Mutser, Paul

Published
2015

79. Trajectory Grouping Structure under Geodesic Distance

Author

Sub Computational Geometry, Computational Geometry, Kostitsyna, Irina, Kreveld, Marc van, Löffler, Maarten, Speckmann, Bettina, Staals, Frank, Sub Computational Geometry, Computational Geometry, Kostitsyna, Irina, Kreveld, Marc van, Löffler, Maarten, Speckmann, Bettina, and Staals, Frank

Published
2015

82. Google Scholar makes it hard - the complexity of organizing one's publications

Author

Algorithmic Systems, Sub Algorithms and Complexity, Sub Computational Geometry, Computational Geometry, Bodlaender, Hans L., van Kreveld, M.J., Algorithmic Systems, Sub Algorithms and Complexity, Sub Computational Geometry, Computational Geometry, Bodlaender, Hans L., and van Kreveld, M.J.

Published
2015

83. A formal approach to the automated labeling of groups of features

Author

Sub Computational Geometry, Computational Geometry, Reimer, A., van Goethem, A., Rylov, M., van Kreveld, M.J., Speckmann, B., Sub Computational Geometry, Computational Geometry, Reimer, A., van Goethem, A., Rylov, M., van Kreveld, M.J., and Speckmann, B.

Published
2015

84. Ecological validity of virtual environments to assess human navigation ability

Author

Leerstoel Postma, Sub Computational Geometry, Computational Geometry, Helmholtz Institute, Experimental Psychology (onderzoeksprogramma PF), Ham, Ineke van der, Faber, Annemarie, Venselaar, Mathhijs, Kreveld, Marc van, Löffler, Maarten, Leerstoel Postma, Sub Computational Geometry, Computational Geometry, Helmholtz Institute, Experimental Psychology (onderzoeksprogramma PF), Ham, Ineke van der, Faber, Annemarie, Venselaar, Mathhijs, Kreveld, Marc van, and Löffler, Maarten

Published
2015

85. Mixed Map Labeling

Author

Computational Geometry, Sub Computational Geometry, Löffler, Maarten, Nöllenburg, Martin, Staals, Frank, Paschos, Vangelis Th., Widmayer, Peter, Computational Geometry, Sub Computational Geometry, Löffler, Maarten, Nöllenburg, Martin, Staals, Frank, Paschos, Vangelis Th., and Widmayer, Peter

Published
2015

87. Optimizing Airspace Closure with respect to Politicians' Egos

Author

Kostitsyna, Irina, Löffler, Maarten, Polishchuk, Valentin, Ferro, Alfredo, Luccio, Fabrizio, Widmayer, Peter, Sub Computational Geometry, Computational Geometry, Algorithms, Sub Computational Geometry, and Computational Geometry

Subjects
Schedule, Operations research, Computer science, On the fly, Closure (topology), CG, ComputerApplications_COMPUTERSINOTHERSYSTEMS, 0102 computer and information sciences, 02 engineering and technology, Time optimal, Data structure, 01 natural sciences, Tree (data structure), 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Graph (abstract data type), 020201 artificial intelligence & image processing, GRAPH, Duration (project management), CG, DS, GRAPH, DS
Abstract

When a president is landing at a busy airport, the airspace around the airport closes for commercial traffic. We show how to schedule the presidential squadron so as to minimize its impact on scheduled civilian flights; to obtain an efficient solution we use a ``rainbow'' algorithm recoloring aircraft on the fly as they are stored in a special type of forest. We also give a data structure to answer the following query efficiently: Given the president's ego (the requested duration of airspace closure), when would be the optimal time to close the airspace? Finally, we study the dual problem: Given the time when the airspace closure must start, what is the longest ego that can be tolerated without sacrificing the general traffic? We solve the problem by drawing a Christmas tree in a delay diagram; the tree allows one to solve also the query version of the problem.

Published
2014
Full Text
View/download PDF

88. Practical Approaches to Partially Guarding a Polyhedral Terrain

Author

Kammer, Frank, Löffler, Maarten, Mutser, Paul, Staals, Frank, Sub Computational Geometry, Computational Geometry, Sub Computational Geometry, and Computational Geometry

Subjects
Guard (information security), Speedup, Observer (quantum physics), Operations research, Computer science, Polyhedral terrain, Computation, Terrain, Fraction (mathematics), ComputerApplications_COMPUTERSINOTHERSYSTEMS, Tower, Algorithm
Abstract

We study the problem of placing guard towers on a terrain such that the terrain can be seen from at least one tower. This problem is important in many applications, and has an extensive history in the literature (known as, e.g., multiple observer siting). In this paper, we consider the problem on polyhedral terrains, and we allow the guards to see only a fixed fraction of the terrain, rather than everything. We experimentally evaluate how the number of required guards relates to the fraction of the terrain that can be covered. In addition, we introduce the concept of dominated guards, which can be used to preprocess the potential guard locations and speed up the subsequent computations. » » Look Inside MyCopy Softcover Edition 24.99 EUR/USD/GBP/CHF Buy Now Other actions Reprints and Permissions Export citation

Published
2014

89. Minimizing Co-location Potential of Moving Entities

Author

Evans, Will, Kirkpatrick, David, Löffler, Maarten, Staals, Frank, Sub Computational Geometry, and Computational Geometry

Subjects
0209 industrial biotechnology, Mathematical optimization, Current (mathematics), General Computer Science, Competitive analysis, General Mathematics, 020207 software engineering, input impression, 02 engineering and technology, computer.software_genre, Measure (mathematics), Upper and lower bounds, Data at Rest, ply, 020901 industrial engineering & automation, Taverne, 0202 electrical engineering, electronic engineering, information engineering, data in motion, competitive analysis, Data mining, computer, Mathematics
Abstract

We study the problem of maintaining knowledge of the locations of $n$ entities that are moving, each with some, possibly different, upper bound on their speed. We assume a setting where we can query the current location of any one entity, but this query takes a unit of time, during which we cannot query any other entities. In this model, we can never know the exact locations of all entities at any one time. Instead, we wish to minimize uncertainty concerning the locations of all entities at some target time that is t units in the future. We measure uncertainty by the ply of the potential locations: the maximum over all points $x$ of the number of entities that could potentially be at $x$. Since the ply could be large for every query strategy, we analyze the performance of our query strategy in a competitive framework: we consider the worst-case ratio of the ply achieved by our strategy to the intrinsic ply (the smallest ply achievable by any strategy, even one that knows in advance the full trajectories of all entities). We describe an efficient strategy that, knowing only an upper bound on the speed of individual entities, is $O(k)$-competitive, provided the lead time t is at least 2n and the number of different entity speed classes (groups of entities whose speed bounds differ by at most a factor of two) is at most $k$. (This contrasts with the fact that, even given the full trajectories, the problem of computing the intrinsic ply is NP-hard.) If t is small, though at least $n$, and the entities move in any constant dimension $d$, our strategy is $O(k(\frac{\widetilde{T}}{n})^{d-\frac{d}{d+1}})$-competitive, where $\widetilde{T}$ is the median of the lengths of time since the $n$ entity locations were last known precisely. Matching lower bounds demonstrate that our strategy, in all cases, is optimally competitive, up to constant factors. Read More: http://epubs.siam.org/doi/10.1137/15M1031217

Published
2016

90. Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022)

Author

Italiano, Giuseppe F., Kreveld, Marc van, Speckmann, Bettina, Theraulaz, Guy, Sub Computational Geometry, and Computational Geometry

Subjects
Motion, 000 Computer science, knowledge, general works, Interaction, Pattern, Computer Science, Trajectory, Geometry, Graph
Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 16022 "Geometric and Graph-based Approaches to Collective Motion". The seminar brought together a group of enthusiastic researchers with a diverse background. To create a shared body of knowledge the seminar featured a number of survey talks that were planned early in the week. The survey talks were rather engaging: the audience learned for instance at what scale one should look at a painting of Van Gogh, how bats chase each other, what size of clumps mussels make and why, and how to interact with a computational geometer.

Published
2016

92. Optimizing Airspace Closure with respect to Politicians' Egos

Author

Sub Computational Geometry, Computational Geometry, Kostitsyna, Irina, Löffler, Maarten, Polishchuk, Valentin, Ferro, Alfredo, Luccio, Fabrizio, Widmayer, Peter, Sub Computational Geometry, Computational Geometry, Kostitsyna, Irina, Löffler, Maarten, Polishchuk, Valentin, Ferro, Alfredo, Luccio, Fabrizio, and Widmayer, Peter

Published
2014

94. Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations

Author

Computational Geometry, Sub Computational Geometry, Buchin, Kevin, Goethem, Arthur van, Hoffmann, Michael, van Kreveld, Marc, Speckmann, Bettina, Michael, P., Computational Geometry, Sub Computational Geometry, Buchin, Kevin, Goethem, Arthur van, Hoffmann, Michael, van Kreveld, Marc, Speckmann, Bettina, and Michael, P.

Published
2014

96. The Connect-The-Dots Family of Puzzles: The Video

Author

Computational Geometry, Sub Computational Geometry, Kaiser, Mira, Kapel, Tim van, Klappe, Gerwin, van Kreveld, Marc, Löffler, Maarten, Staals, Frank, Computational Geometry, Sub Computational Geometry, Kaiser, Mira, Kapel, Tim van, Klappe, Gerwin, van Kreveld, Marc, Löffler, Maarten, and Staals, Frank

Published
2014

97. Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

Author

Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, Marc, Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, Welzl, Emo, Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, Marc, Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, and Welzl, Emo

Published
2014

98. The Connect-The-Dots Family of Puzzles: Design and Automatic Generation

Author

Sub Computational Geometry, Computational Geometry, Löffler, Maarten, Kaiser, Mira, van Kapel, Tim, Klappe, Gerwin, van Kreveld, Marc, Staals, Frank, Sub Computational Geometry, Computational Geometry, Löffler, Maarten, Kaiser, Mira, van Kapel, Tim, Klappe, Gerwin, van Kreveld, Marc, and Staals, Frank

Published
2014

99. Practical Approaches to Partially Guarding a Polyhedral Terrain

Author

Sub Computational Geometry, Computational Geometry, Kammer, Frank, Löffler, Maarten, Mutser, Paul, Staals, Frank, Sub Computational Geometry, Computational Geometry, Kammer, Frank, Löffler, Maarten, Mutser, Paul, and Staals, Frank

Published
2014

100. Google Scholar makes it Hard - the complexity of organizing one's publications

Author

Decision Support Systems, Computational Geometry, Sub Decision Support Systems, Sub Computational Geometry, Bodlaender, Hans L., van Kreveld, Marc, Decision Support Systems, Computational Geometry, Sub Decision Support Systems, Sub Computational Geometry, Bodlaender, Hans L., and van Kreveld, Marc

Published
2014

Catalog

Books, media, physical & digital resources
See catalog results