Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Parallel search algorithm for finding the closest object in a collection of polygonal models
Parallel search algorithm for finding the closest object in a collection of polygonal models
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Aksoy Tevfik Oguzhan
Format:
Recurso digital
Language:
Russian
Published:
Zenodo
2023
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://doi.org/10.5281/zenodo.8064031
Similar Items
An algorithm to find maximum area polygons circumscribed about a convex polygon
by: Ausserhofer, Markus, et al.
Published: (2017)
Parameterized quantum algorithms for closest string problems
by: Cudby, Josh, et al.
Published: (2025)
Grover's search meets Ising models: a quantum algorithm for finding low-energy states
by: Zhukov, Andrey, et al.
Published: (2024)
On the closest balanced game
by: García-Segador, Pedro, et al.
Published: (2026)
Learning the closest product state
by: Bakshi, Ainesh, et al.
Published: (2024)