An efficient algorithm to find a set of nearest elements in a mesh
Data Structures and Algorithms
2011-10-04 v1
Authors:
Gleb Novichkov
Abstract
A linear time algorithm to find a set of nearest elements in a mesh.
Cite
@article{arxiv.1110.0180,
title = {An efficient algorithm to find a set of nearest elements in a mesh},
author = {Gleb Novichkov},
journal= {arXiv preprint arXiv:1110.0180},
year = {2011}
}
Comments
raw version. to be improved later on
Related papers
View all related →
Data Structures and Algorithms · Computer Science
An efficient parallel algorithm for the longest path problem in meshes
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2012-01-24
Discrete Mathematics · Computer Science
The minimum linear arrangement problem on proper interval graphs
Ilya Safro
2007-05-23
Data Structures and Algorithms · Computer Science
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning
Daniel A. Spielman, Shang-Hua Teng
2008-09-19
Data Structures and Algorithms · Computer Science
Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection
Kaan Gokcesu, Hakan Gokcesu
2021-09-13
Data Structures and Algorithms · Computer Science
A linear-time algorithm for finding the longest segment which scores above a given threshold
Miklós Csűrös
2007-05-23
Data Structures and Algorithms · Computer Science
Simple, efficient maxima-finding algorithms for multidimensional samples
Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai
2009-10-09
Data Structures and Algorithms · Computer Science
Efficient Approximate Search for Sets of Vectors
Michael Leybovich, Oded Shmueli
2021-08-31
Data Structures and Algorithms · Computer Science
Efficient algorithms for enumerating maximal common subsequences of two strings
Miyuji Hirota, Yoshifumi Sakai
2023-07-21
Data Structures and Algorithms · Computer Science
Approximate Least Squares
Michael Lunglmayr, Christoph Unterrieder, Mario Huemer
2016-11-15
Systems and Control · Computer Science
A Distributed Algorithm for Least Square Solutions of Linear Equations
Xuan Wang, Jingqiu Zhou, Shaoshuai Mou, Martin J. Corless
2017-10-02
Discrete Mathematics · Computer Science
Finding Paths and Cycles in Graphs
Sergey Gubin
2007-09-10
Social and Information Networks · Computer Science
An approximation algorithm for shortest path based on the hierarchy networks
Shi-nan Gong, Duan-bing Chen, Hui Gao, Guan-nan Wang +1
2015-06-29
Machine Learning · Computer Science
Algorithmic Solution for Systems of Linear Equations, in $\mathcal{O}(mn)$ time
Nikolaos P. Bakas
2023-09-26
Data Structures and Algorithms · Computer Science
Low Power Mesh Algorithms for Image Problems
Quentin Stout
2022-12-07
Data Structures and Algorithms · Computer Science
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Daniel Lemire, Martin Brooks, Yuhong Yan
2007-05-23
Mathematical Software · Computer Science
An algorithm for the optimization of finite element integration loops
Fabio Luporini, David A. Ham, Paul H. J. Kelly
2017-05-11
Data Structures and Algorithms · Computer Science
Finding Nearest Neighbors in graphs locally
Abhinav Mishra
2019-02-18
Information Theory · Computer Science
Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
Fernando Hernando, Francisco D. Igual, Gregorio Quintana-Ortí
2024-05-01
Data Structures and Algorithms · Computer Science
Similar Elements and Metric Labeling on Complete Graphs
Pedro F. Felzenszwalb
2018-03-28
Data Structures and Algorithms · Computer Science
Minimum-weight partitioning of a set with associated subsets
Yakov Zinder, Bertrand M. T. Lin, Joanna Berlińska
2022-12-13
Distributed, Parallel, and Cluster Computing · Computer Science
An optimal local approximation algorithm for max-min linear programs
Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela
2012-05-15
Machine Learning · Computer Science
Encoding of data sets and algorithms
Katarina Doctor, Tong Mao, Hrushikesh Mhaskar
2023-03-03
Data Structures and Algorithms · Computer Science
Hash sort: A linear time complexity multiple-dimensional sort algorithm
William F. Gilreath
2007-05-23
Computational Geometry · Computer Science
Optimal Point Placement for Mesh Smoothing
Nina Amenta, Marshall Bern, David Eppstein
2010-01-21
Machine Learning · Statistics
MEMe: An Accurate Maximum Entropy Method for Efficient Approximations in Large-Scale Machine Learning
Diego Granziol, Binxin Ru, Stefan Zohren, Xiaowen Doing +2
2019-06-05