Results 231 to 240 of about 822,340 (280)

FlowMol3: flow matching for 3D <i>de novo</i> small-molecule generation.

Digit Discov
Dunn I, Koes DR.
europepmc   +1 more source

Black hole information turbulence and the Hubble tension. [PDF]

Sci Rep
Cabrera Fernández JL.
europepmc   +1 more source

Computational Geometry and Linear Programming(Computational Geometry and Discrete Geometry)

Computational Geometry and Linear Programming(Computational Geometry and Discrete Geometry)
openaire  

Some of the next articles are maybe not open access.

Related searches:

Computational geometry and computer graphics

Proceedings of the IEEE, 1992
The interaction between computer graphics and computational geometry is explored through two scenarios. Spatial subdivisions studied from the viewpoint of computational geometry are shown to have found application in computer graphics. Hidden surface removal problems of computer graphics have led to sweep-line and area subdivision algorithms in ...
exaly   +2 more sources

Computational geometry

ACM SIGACT News, 2001
A compendium of thirty previously published open problems in computational geometry is ...
Isabel M. Beichl, Javier Bernal, Christoph Witzgall, Francis Sullivan   +3 more
openaire   +2 more sources

Computational geometry

ACM SIGACT News, 1998
Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.
Pankaj K. Agarwal, Joseph O'Rourke
openaire   +1 more source

Computational Geometry—A Survey

IEEE Transactions on Computers, 1984
We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in various other disciplines, such as computer-aided design, computer graphics, operations research, pattern
D. T. Lee, Franco P. Preparata
openaire   +2 more sources

Computational geometry on hypercube computers

Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988
This paper gives hypercube algorithms for some simple problems involving geometric properties of sets of points. The properties considered emphasize aspects of convexity and domination. Efficient algorithms are given for both fine-grain and medium-grain hypercube computers.
Russ Miller, Quentin F. Stout
openaire   +1 more source