• Home
  • Search
  • A Fast Exact Algorithm for Computing the Hypervolume Contributions in 4-D Space
  • Cite Icon3
  • https://doi.org/10.1109/tevc.2023.3271679Copy DOI Icon

A Fast Exact Algorithm for Computing the Hypervolume Contributions in 4-D Space

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The hypervolume contribution is widely used in indicator-based multiobjective algorithms. We propose an algorithm to compute exact 4-D hypervolume contributions for a set of n points in O(n32logn) time. Our algorithm improves the currently best time complexity O(n2) by O(nlogn), and it is the first algorithm of subquadratic time for this problem. Our algorithm is built upon a space partition method in computational geometry and a geometric structure called the anchored gradient. We also propose a new space partition strategy to reduce the practical running time and the space overhead of this algorithm. Experimental results on a variety of test instances show that our proposed algorithm performs better than the existing state-of-the-art algorithm especially on point sets with cliff or other irregular properties.

Similar Papers
  • Single Book
  • Citations47

Polyhedral and Algebraic Methods in Computational Geometry

  • Jan 01, 2013
  • Michael Joswig +1
  • Book Chapter

Solving Three-Objective Flow Shop Problem with Fast Hypervolume-Based Local Search Algorithm

  • Jan 01, 2014
  • Rong-Qiang Zeng +1
  • PDF
  • Research Article
  • Citations11

Accelerating statistical human motion synthesis using space partitioning data structures

  • May 01, 2017
  • Computer Animation and Virtual Worlds
  • Erik Herrmann +4
  • Research Article
  • Citations26

Exploring urban space quantitative indicators associated with outdoor ventilation potential

  • Apr 01, 2022
  • Sustainable Cities and Society
  • Jiaying Li +2
  • Single Book
  • Citations1326

Handbook of Discrete and Computational Geometry, Second Edition

  • Apr 13, 2004
  • Csaba D Toth +1
  • Research Article
  • Citations1

Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization

  • Sep 01, 2010
  • Evolutionary Computation
  • Thomas Jansen +1
  • Research Article
  • Citations10

A faster FPTAS for knapsack problem with cardinality constraint

  • Apr 04, 2022
  • Discrete Applied Mathematics
  • Wenxin Li +2
  • Research Article
  • Citations27

A Euclid style algorithm for MacMahon's partition analysis

  • Dec 05, 2014
  • Journal of Combinatorial Theory, Series A
  • Guoce Xin
  • Book Chapter
  • Citations4

A fast heuristic for approximating the minimum weight triangulation

  • Jan 01, 1996
  • Christos Levcopoulos +1
  • Research Article
  • Citations78

Faster ray tracing using adaptive grids

  • Jan 01, 1997
  • IEEE Computer Graphics and Applications
  • K Klimaszewski +1
  • Research Article
  • Citations1

Three-dimensional hologram generation method based on space-division

  • Jul 06, 2019
  • Optik
  • Ping Su +3
  • Research Article
  • Citations1

Market areas in general equilibrium

  • May 29, 2023
  • Journal of Economic Theory
  • Gianandrea Lanzara +1
  • Book Chapter
  • Citations11

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time

  • Jan 01, 2019
  • Uriel Feige +2
  • Research Article
  • Citations1

Visibilty: Finding the Staircase Kernel in Orthogonal Polygons

  • Aug 31, 2012
  • American Journal of Computational and Applied Mathematics
  • Stefan A Pape +1
  • Book Chapter

How to Achieve an Equivalent Simple Permutation in Linear Time

  • Sep 16, 2007
  • Simon Gog +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.