• Corpus ID: 61935445

A Rasterizing Algorithm for Drawing Curves

@inproceedings{Zingl2012ARA,
  title={A Rasterizing Algorithm for Drawing Curves},
  author={Alois Zingl},
  year={2012}
}
This work deals with rasterizing of curves. [] Key Method A common method is developed on the basis of the implicit equation of the curve. This principle is then proven on circles and ellipses. Subsequently the algorithm is applied on more complex curves like Béziers. This algorithm selects the closest mesh pixel to the true curves and makes it possible to draw complex curves nearly as quickly and easily as simple lines. The thereby emerging problems are considered and various solutions outlined.

Bresenham's Line and Circle Drawing Algorithm using FPGA

TLDR
This research deals with the Bresenham’s line and circle drawing algorithm based on FPGA hardware platform, which is among the oldest algorithms that have been developed in computer graphics.

Morphological Image Analysis for Computer Vision Applications

TLDR
It is shown how the tasks of change detection and shape matching in images can be solved using a morphological image analysis and the projective morphology as a generalized framework based on the mathematical morphology and the morphed image analysis provides fast and efficient solutions of morphological segmentation problem in complex images.

Chapter 2. Morphological Image Analysis for Computer Vision Applications

TLDR
It is shown how the tasks of change detection and shape matching in images can be solved using a morphological image analysis and the projective morphology as a generalized framework based on the mathematical morphology and the morphed image analysis provides fast and efficient solutions of morphological segmentation problem in complex images.

Aligning Polylines to Line Features on Bitmap Images of Historical Maps

TLDR
A number of algorithmic approaches are developed and evaluated to create accurate annotations for line features like roads, waterways or contour lines based on degraded data sets or sketched human contributions with increased geometric accuracy.

ORIENTATION SPECTRUM ALGORITHM DEVELOPMENT

TLDR
Results indicate that the aggregation of the thickness spectra with orientation spectra increases the quality of inter-class recognition and this spectrum describes basic directions of shape parts.

Learning to Reconstruct 3D Manhattan Wireframes From a Single Image

TLDR
This work proposes a method to effectively exploit the global structural regularities for obtaining a compact, accurate, and intuitive 3D wireframe representation by trains a single convolutional neural network to simultaneously detect salient junctions and straight lines, as well as predict their 3D depth and vanishing points.

On iris detection for mobile device applications

TLDR
A novel transform called Gradient Direction Transform for fast detection of naturally curved items in digital images is described in this article, defined to suit platforms with limited memory and processing footprints by utilizing only additions and simple shift and bitwise operations.

Global Planning and Mapping

TLDR
The proposed approach relies on OSM data to firstly use a global planner to find a route that reach a destination point set through the HMI, and then it is computed a road corridor in which the vehicle will be able to drive.

Motion Planning Approach Considering Localization Uncertainty

TLDR
The proposed motion planning solution for automated driving is able to generate safe human-like trajectories in real time while considering the localization uncertainty, ego-vehicle constrains and obstacles and a motion planning strategy that relies on such occupancy grid.

A workflow for characterizing nanoparticle monolayers for biosensors: Machine learning on real and artificial SEM images

TLDR
This work outlines a work for characterizing and classifying nanoscale features on low-magnification images with thousands of nanoparticles, and demonstrates the decomposition of a nanoparticle image into particle subtypes relevant to the authors' application.

References

SHOWING 1-10 OF 11 REFERENCES

A Method of Deviation for Drawing Implicit Curves

In contrast to the mid point technique, which may not be successful in a region where two edges of a curve cross each other, this paper introduces a unified approach called Method of Deviation that

Applied Geometry for Computer Graphics

TLDR
This book explores the application of geometry to computer graphics and computer-aided design (CAD) and provides a foundation in the extensive applications of geometry in real world situations.

Some applications of resultants to problems in computational geometry

TLDR
Some applications of resultants to several important problems in computational geometry, including the implicitization, inversion, and intersection of parametric rational polynomial curves and surfaces are presented.

A UNIVERSAL METHOD OF SOLVING QUARTIC EQUATIONS

TLDR
All the existing methods of solving quartic equations are particular versions of some universal method, which enables producing an arbitrary number of other particular algorithms with some desired properties.

Algorithm for computer control of a digital plotter

An algorithm is given for computer control of a digital plotter. The algorithm may be programmed without multiplication or division instructions and is efficient with respect to speed of execution

Sederberg: Some applications of resultants to problems in computational geometry; The Visual Computer

  • Volume 1, Number 2, 101-107,
  • 1985

Sederberg: Computer Aided Geometric Design Course Notes; Brigham Young University

  • http://tom.cs.byu.edu/~557/,
  • 2011

Bimal Kumar Ray: A Method of Deviation for Drawing Implicit Curves; International Journal of Computer Graphics

  • Vol. 2, No. 2, November
  • 2011

Yong Kui Liu: A Pixel Level Algorithm for Drawing Curves; Proceedings of the 6th Chinese Automation and Computer Science Conference in the UK

  • Loughborough,
  • 2000