Vertex-unfoldings of simplicial manifolds
Proceedings of the eighteenth annual symposium on Computational geometry
On moving object queries: (extended abstract)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Interactive motion generation from examples
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
A Simple Approach to Recognise Geometric Shapes Interactively
GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances
Efficient Shape Description Using NURBS
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Revisiting R-Tree Construction Principles
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An alternating heuristic for medianoid and centroid problems in the plane
Computers and Operations Research
A probabilistic approach to inference with limited information in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry: Theory and Applications
Proceedings of the twenty-second annual symposium on Computational geometry
An improved method for calculating the no-fit polygon
Computers and Operations Research
Contour map matching for event detection in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Motion-capture-based avatar control framework in third-person view virtual environments
Proceedings of the 2006 ACM SIGCHI international conference on Advances in computer entertainment technology
Museum security enhanced using genetic algorithms and virtual reality
SIGGRAPH '04 ACM SIGGRAPH 2004 Posters
A New Active Convex Hull Model for Image Regions
Journal of Mathematical Imaging and Vision
B-rep SE: simplicially enhanced boundary representation
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
All-hexahedral remeshing for the finite element analysis of metal forming processes
Finite Elements in Analysis and Design
A weighted cache replacement policy for location dependent data in mobile environments
Proceedings of the 2007 ACM symposium on Applied computing
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An immersed boundary method for compressible flows using local grid refinement
Journal of Computational Physics
Pattern Recognition
Randomized Algorithms for Minimum Distance Localization
International Journal of Robotics Research
Fast computation of spatial selections and joins using graphics hardware
Information Systems
A new interface tracking method: The polygonal area mapping method
Journal of Computational Physics
A new architecture for efficient hybrid representation of terrains
Journal of Systems Architecture: the EUROMICRO Journal
Hausdorff approximation of 3D convex polytopes
Information Processing Letters
Harmonic Variation of Edge Size in Meshing CAD Geometries from IGES Format
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
Planner for sheet metal components to obtain optimal bend sequence using a genetic algorithm
International Journal of Computer Integrated Manufacturing
HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
Journal of Computational Physics
A sweep-line algorithm for spatial clustering
Advances in Engineering Software
Rotationally monotone polygons
Computational Geometry: Theory and Applications
Morphing polyhedra with parallel faces: Counterexamples
Computational Geometry: Theory and Applications
Single facility collection depots location problem in the plane
Computational Geometry: Theory and Applications
Localised convex hulls to identify boundary nodes in sensor networks
International Journal of Sensor Networks
Bounds for point recolouring in geometric graphs
Computational Geometry: Theory and Applications
Dynamic hybrid terrain representation based on convexity limits identification
International Journal of Geographical Information Science
Montage: a grid portal and software toolkit for science-grade astronomical image mosaicking
International Journal of Computational Science and Engineering
On surface reconstruction: A priority driven approach
Computer-Aided Design
Approximate minimum spanning tree clustering in high-dimensional space
Intelligent Data Analysis
SMOTE: synthetic minority over-sampling technique
Journal of Artificial Intelligence Research
The Erdős--Nagy theorem and its ramifications
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry: Theory and Applications
Algebraic and geometric approximation of waves among obstacles
Computer-Aided Design
International Journal of Ad Hoc and Ubiquitous Computing
An improved method for calculating the no-fit polygon
Computers and Operations Research
Object and image indexing based on region connection calculus and oriented matroid theory
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
On the reliability of triangle intersection in 3D
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Scale Space'03 Proceedings of the 4th international conference on Scale space methods in computer vision
Knowledge-based schedule generation and evaluation
Advanced Engineering Informatics
A new point containment test algorithm based on preprocessing and determining triangles
Computer-Aided Design
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An efficient strategy for fast object search considering the robot's perceptual limitations
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Evaluating coverage quality through best covered pathes in wireless sensor networks
Proceedings of the Nineteenth International Workshop on Quality of Service
Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
Advances in Engineering Software
An algorithm to detect the weak-symmetry of a simple polygon
ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part I
Geodetic point-in-polygon query processing in oracle spatial
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Processing (multiple) spatio-temporal range queries in multicore settings
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Automatic human model generation
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Virtual Reality in Brazil 2011: Simulating crowds based on a space colonization algorithm
Computers and Graphics
Border samples detection for data mining applications using non convex hulls
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
Polygon optimisation for the modelling of planar range data
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Computer Graphics Forum
Slime mould computes planar shapes
International Journal of Bio-Inspired Computation
Providing and finding k-road-coverage efficiently in wireless sensor networks
Wireless Communications & Mobile Computing
Accelerating pathology image data cross-comparison on CPU-GPU hybrid systems
Proceedings of the VLDB Endowment
Towards augmented connectivity with delay constraints in WSN federation
International Journal of Ad Hoc and Ubiquitous Computing
Topological relationship query processing for complex regions in Oracle Spatial
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Direct multiple shooting method for solving approximate shortest path problems
Journal of Computational and Applied Mathematics
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique
Journal of Combinatorial Theory Series A
All-hexahedral meshing and remeshing for multi-object manufacturing applications
Computer-Aided Design
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Range-aggregate queries for geometric extent problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Video key frame extraction through dynamic Delaunay clustering with a structural constraint
Journal of Visual Communication and Image Representation
Fast rotation search for real-time interactive point cloud registration
Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
hp-boundary layer mesh sequences with applications to shell problems
Computers & Mathematics with Applications
Coverage enhancement by using the mobility of mobile sensor nodes
Multimedia Tools and Applications
Hi-index | 0.02 |
From the Publisher:This is the newly revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangualtions, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but it reaches topics on the frontier of current research. Thus professional programmers will find it a useful tutorial.