Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0049415
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

SIAM Journal on Computing
MathematicsComputer Science
2002English

Evolutionary Algorithms for Solving Quasi Geometric Programming Problems

2010English

Fast and Accurate Solutions of Extremely Large Scattering Problems Involving Three-Dimensional Canonical and Complicated Objects

2009English

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Fast LP-based Approximations for Geometric Packing and Covering Problems

2020English

Fast Moving Objects Detection Using iLBP Background Model

ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
2014English

Comparison of Integral-Equation Formulations for the Fast and Accurate Solution of Scattering Problems Involving Dielectric Objects With the Multilevel Fast Multipole Algorithm

IEEE Transactions on Antennas and Propagation
Electronic EngineeringElectricalCondensed Matter Physics
2009English

Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2001English

Enriched Reproducing Kernel Particle Approximation for Simulating Problems Involving Moving Interfaces

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy