Efficient computation of the convex hull on sets of points stored in a k-tree compact data structure
Sign Up to like & getrecommendations! Published in 2020 at "Knowledge and Information Systems"
DOI: 10.1007/s10115-020-01486-9
Abstract: In this paper, we present two algorithms to obtain the convex hull of a set of points that are stored in the compact data structure called k2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt}… read more here.
Keywords: compact data; convex hull; usepackage; data structure ... See more keywords