Generalized hidden surface removal
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing the discrepancy with applications to supersampling patterns
ACM Transactions on Graphics (TOG)
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal placement of convex polygons to maximize point containment
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Semi-online maintenance of geometric optima and measures
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for shared camera control
Proceedings of the nineteenth annual symposium on Computational geometry
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Engineering details of a stable force-directed placer
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
An in-place algorithm for Klee's measure problem in two dimensions
Information Processing Letters
Computing the volume of the union of cubes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry
Don't be greedy when calculating hypervolume contributions
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
S-metric calculation by considering dominated hypervolume as klee's measure problem
Evolutionary Computation
On the complexity of computing the hypervolume indicator
IEEE Transactions on Evolutionary Computation
Real-time resource allocation for LEO satellite constellations
Wireless Networks
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
Klee's measure problem on fat boxes in time ∂(n(d+2)/3)
Proceedings of the twenty-sixth annual symposium on Computational geometry
An improved algorithm for computing the volume of the union of cubes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Integrating decision space diversity into hypervolume-based multiobjective search
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Computing toolpaths for 5-axis NC machines
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
An efficient algorithm for computing hypervolume contributions**
Evolutionary Computation
Ectropy of diversity measures for populations in Euclidean space
Information Sciences: an International Journal
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
The union of probabilistic boxes: maintaining the volume
ESA'11 Proceedings of the 19th European conference on Algorithms
The mono- and bichromatic empty rectangle and square problems in all dimensions
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
An improved algorithm for Klee's measure problem on fat boxes
Computational Geometry: Theory and Applications
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
Theoretical Computer Science
Rectangle-efficient aggregation in spatial data streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
On Klee's measure problem for grounded boxes
Proceedings of the twenty-eighth annual symposium on Computational geometry
Optimal placement of convex polygons to maximize point containment
Computational Geometry: Theory and Applications
One-way and round-trip center location problems
Discrete Optimization
Computing feasible toolpaths for 5-axis machines
Theoretical Computer Science
Parameterized average-case complexity of the hypervolume indicator
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Improved algorithms to network p-center location problems
Computational Geometry: Theory and Applications
| Hi-index | 0.02 |