A perturbation scheme for spherical arrangements with application to molecular modeling

DOI10.1016/S0925-7721(98)00014-5zbMath0904.68173MaRDI QIDQ1265287

Dan Halperin, Christian R. Shelton

Publication date: 28 September 1998

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

molecular models

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

PLANAR SHAPE MANIPULATION USING APPROXIMATE GEOMETRIC PRIMITIVES ⋮ CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES ⋮ DELAUNAY STABILITY VIA PERTURBATIONS ⋮ Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ Computing the arrangement of circles on a sphere, with applications in structural biology ⋮ A general approach to the analysis of controlled perturbation algorithms ⋮ Iterated snap rounding with bounded drift ⋮ Classroom examples of robustness problems in geometric computations ⋮ Out-of-order event processing in kinetic data structures ⋮ Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order ⋮ EXACT ALGORITHMS FOR CIRCLES ON THE SPHERE ⋮ A perturbation scheme for spherical arrangements with application to molecular modeling ⋮ Crushing Disks Efficiently ⋮ Of What Use Is Floating-Point Arithmetic in Computational Geometry?

Uses Software

• Hull

Cites Work

• On finite-precision representations of geometric objects
• Two design principles of geometric algorithms in finite-precision arithmetic
• A geometric consistency theorem for a symbolic perturbation scheme
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• A perturbation scheme for spherical arrangements with application to molecular modeling
• The nature and meaning of perturbations in geometric computing
• Applied computational geometry. Towards geometric engineering. FCRC '96 workshop, WACG '96, Philadelphia, PA, USA, May 27--28, 1996. Selected papers
• Practical segment intersection with finite precision output
• Efficient exact evaluation of signs of determinants
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item