Results 241 to 250 of about 123,753 (267)

A general algorithm for output-sensitive visibility preprocessing

Proceedings of the 2005 symposium on Interactive 3D graphics and games, 2005
Occlusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a new general algorithm that performs the visibility precomputation for a group of viewcells in an output-sensitive fashion.
openaire   +1 more source

Output-Sensitive Algorithms for Uniform Partitions of Points

1999
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size buckets so that the maximum number of points in a bucket is minimized. Suppose at most (n/b) + Δ points lies in each bucket in an optimal solution.
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen   +2 more
openaire   +1 more source

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm

Journal of Algorithms, 1997
Summary: We present a truly practical and provably optimal \(O(n\log h)\) time output-sensitive algorithm for the planar convex hull problem. The basic algorithm is similar to the algorithm presented by \textit{T. M. Chan}, \textit{J. Snoeyink}, and \textit{C. K. Yap} [Clarkson, K.
Bhattacharya, Binay K., Sen, Sandeep
openaire   +2 more sources

Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima

Journal of Parallel and Distributed Computing, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Neelima, Sen, Sandeep
openaire   +1 more source

An efficient output-sensitive hidden surface removal algorithm and its parallelization

Proceedings of the fourth annual symposium on Computational geometry - SCG '88, 1988
In this paper we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly like the terrain maps. A distinguishing feature of this algorithm is that its running time is sensitive to the actual size of the visible image rather than the total number of ...
J. H. Reif, S. Sen
openaire   +1 more source

Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals

2017
We consider the space-efficient implementation of greedy algorithms for several fundamental problems on intervals. We assume a random access machine model with read-only access to input stored in \(\varTheta (n)\) words of memory, augmented with a random access memory (workspace) of size \(\varTheta (s)\) bits, where \(\lg n \le s \le n\).
Toshiki Saitoh, David G. Kirkpatrick
openaire   +1 more source

Clinical management of metastatic colorectal cancer in the era of precision medicine

Ca-A Cancer Journal for Clinicians, 2022
, Davide Ciardiello, Giulia Martini
exaly  

Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms

2000
In this paper, we review and analyze the complexity of a paradigm called grouping-and-querying which has been used in the past for computing convex hulls of points or objects on the plane, maximal and convex layer decompositions, lower envelopes of functions, etc.
openaire   +1 more source

Simplified algorithm for genetic subtyping in diffuse large B-cell lymphoma

Signal Transduction and Targeted Therapy, 2023
Qing Shi, Wei-Li Zhao
exaly  

The Arithmetic Optimization Algorithm

Computer Methods in Applied Mechanics and Engineering, 2021
Laith Mohammad Abualigah, Ali H Diabat, Seyedali Mirjalili   +2 more
exaly