Results 121 to 130 of about 939,183 (156)
Some of the next articles are maybe not open access.

Traditional soil particle sphericity, roundness and surface roughness by computational geometry

, 2015
Definitions of soil particle sphericity, roundness and roughness have existed since at least the 1930s. In the 1950s, charts of typical sphericity and roundness values were developed to alleviate tedious manual determination.
Junxing Zheng, R. D. Hryciw
semanticscholar   +1 more source

The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk)

International Symposium on Computational Geometry, 2017
For the past 10 years, combinatorial geometry (and to some extent, computational geometry too) has gone through a dramatic revolution, due to the infusion of techniques from algebraic geometry and algebra that have proven effective in solving a variety ...
M. Sharir
semanticscholar   +1 more source

A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge)

International Symposium on Computational Geometry, 2021
The third computational geometry challenge was on a coordinated motion planning problem in which a collection of square robots need to move on the integer grid, from their given starting points to their target points, and without collision between robots,
Hyeyun Yang, A. Vigneron
semanticscholar   +1 more source

Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry

International Symposium on Computational Geometry, 2017
We apply the polynomial method - specifically, Chebyshev polynomials - to obtain a number of new results on geometric approximation algorithms in low constant dimensions.
Timothy M. Chan
semanticscholar   +1 more source

Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid (CG Challenge)

International Symposium on Computational Geometry
Our work on nesting polygons is based on two key components: (1) a hierarchy of uniform integer grids for maintaining free space within the container during the nesting such that placement queries can be answered reasonably efficiently, and (2) priority ...
Martin Held
semanticscholar   +1 more source

A General Heuristic Approach for Maximum Polygon Packing (CG Challenge)

International Symposium on Computational Geometry
This work proposes a general heuristic packing approach to address the Maximum Polygon Packing Problem introduced by the CG:SHOP 2024 Challenge. Our solver primarily consists of two steps: (1) Partitioning the container and polygons to form a series of ...
Canhui Luo, Zhouxing Su, Zhipeng Lü
semanticscholar   +1 more source

Computational Geometry

Computing Handbook, 3rd ed., 2014
We overview the basics of computational geometry, discuss its relation to GIS, and analyze in which directions research can develop that lies in the intersection of GIS and ...
M. V. Kreveld
semanticscholar   +1 more source

Sphericity and roundness for three-dimensional high explosive particles by computational geometry

Computational Particle Mechanics, 2022
Xianzhen Jia   +7 more
semanticscholar   +1 more source

The Geometry of Prompting: Unveiling Distinct Mechanisms of Task Adaptation in Language Models

North American Chapter of the Association for Computational Linguistics
Decoder-only language models have the ability to dynamically switch between various computational tasks based on input prompts. Despite many successful applications of prompting, there is very limited understanding of the internal mechanism behind such ...
Artem Kirsanov   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy